YES 2019-05-11 07:09:09,231 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:09,234 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:09,239 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:09,239 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:09,240 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:09,240 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:09,240 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:09,241 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:09,241 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:09,244 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:09,244 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:09,245 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:09,245 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:09,245 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:09,245 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:09,247 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:11,540 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:11,541 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:11,541 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:11,541 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:11,951 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:11,951 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:11,952 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:11,952 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:11,952 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:11,952 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:11,953 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:11,953 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:11,953 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:11,953 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:11,953 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:11,954 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:11,954 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:11,954 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:11,954 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:11,955 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:11,955 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:11,956 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:11,956 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:11,956 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:11,956 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:11,956 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:11,957 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:11,957 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:11,957 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:11,957 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:11,957 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:11,958 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:11,958 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:11,958 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:11,958 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:11,958 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:11,959 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:11,959 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:11,959 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:12,237 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:12,249 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:12,250 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:12,252 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:12,254 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:12,254 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:12,255 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:12,395 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:12,438 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:12,440 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:12,440 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:12,444 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:12,445 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,559 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:12,560 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:12,560 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:12,560 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:12,577 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,582 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,582 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,584 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,585 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,587 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,588 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:12,589 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:12,589 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:12,589 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:12,591 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,691 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:09:12,694 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:12,815 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:12,816 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:12,816 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:12,817 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:12,818 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,835 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:12" (1/1) ... 2019-05-11 07:09:12,862 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:12,863 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:12,884 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:12,884 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:12,884 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:12,885 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:12,886 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:12" (1/5) ... 2019-05-11 07:09:12,887 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:12" (2/5) ... 2019-05-11 07:09:12,887 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:12" (3/5) ... 2019-05-11 07:09:12,888 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:12" (4/5) ... 2019-05-11 07:09:12,888 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:12" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:13,009 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:13,009 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:13,010 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:13,010 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:13,013 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:13" (1/1) ... 2019-05-11 07:09:15,820 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:15,821 INFO [Benchmark.java:150]: Toolchain (without parser) took 3424.80 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 483.6 MB in the end (delta: 126.6 MB). Peak memory consumption was 126.6 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,823 INFO [Benchmark.java:150]: CDTParser took 128.39 ms. Allocated memory is still 649.6 MB. Free memory was 615.6 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,824 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 119.50 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,825 INFO [Benchmark.java:150]: Boogie Preprocessor took 28.75 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,826 INFO [Benchmark.java:150]: RCFGBuilder took 226.74 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,827 INFO [Benchmark.java:150]: BlockEncoding took 68.08 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,828 INFO [Benchmark.java:150]: TraceAbstraction took 125.23 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 578.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,829 INFO [Benchmark.java:150]: BuchiAutomizer took 2810.56 ms. Allocated memory is still 649.6 MB. Free memory was 578.3 MB in the beginning and 483.6 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,835 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:09:15,836 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:15,836 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:15,836 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:15,836 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:15,836 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 14]: Procedure Contract for main 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:15,837 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:09:15,838 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:15,838 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:15,838 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y2 + 0 and consists of 5 locations. One deterministic module has affine ranking function -1 * y2 + y1 + 0 and consists of 5 locations. One deterministic module has affine ranking function y1 + -1 * y2 + 0 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 + 0 and consists of 6 locations. 2019-05-11 07:09:15,838 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:15,838 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~y1~2 != ~y2~2);" "assume true;" "assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume !(~y1~2 > 0 && ~y2~2 > 0);" "#res := 0;assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~y1~2 != ~y2~2);" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "assume true;" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" }, returnAlphabet = {"return;" "return;" }, states = {"34#false" "69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "59#unseeded" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"59#unseeded" }, finalStates = {"34#false" "69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))" }, callTransitions = { ("59#unseeded" "call #t~ret2 := main();" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("59#unseeded" "call ULTIMATE.init();" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("34#false" "assume true;" "34#false") ("34#false" "assume true;" "34#false") ("34#false" "#res := 0;assume true;" "34#false") ("69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))" "assume !true;" "34#false") ("69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))" "assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))" "assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume !(~y1~2 != ~y2~2);" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume !true;" "34#false") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume !!(~y1~2 != ~y2~2);" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))" "#res := 0;assume true;" "70#(and (<= main_~y2~2 oldRank0) (<= 1 main_~y1~2))") ("59#unseeded" "assume true;" "59#unseeded") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "69#(and (<= 0 oldRank0) (<= (+ main_~y2~2 1) oldRank0) (<= 1 main_~y1~2))") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume !(~y1~2 > 0 && ~y2~2 > 0);" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("34#false" "59#unseeded" "return;" "34#false") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "59#unseeded" "return;" "59#unseeded") ("62#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "59#unseeded" "return;" "59#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~y1~2 != ~y2~2);" "assume true;" "assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume !(~y1~2 > 0 && ~y2~2 > 0);" "#res := 0;assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~y1~2 != ~y2~2);" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "assume true;" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" }, returnAlphabet = {"return;" "return;" }, states = {"181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "172#unseeded" "175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"172#unseeded" }, finalStates = {"185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" }, callTransitions = { ("172#unseeded" "call #t~ret2 := main();" "175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#unseeded" "call ULTIMATE.init();" "175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") ("185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume !!(~y1~2 != ~y2~2);" "186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume true;" "186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume true;" "186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume !!(~y1~2 != ~y2~2);" "186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("186#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "185#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") ("175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("175#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "172#unseeded" "return;" "172#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~y1~2 != ~y2~2);" "assume true;" "assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume !(~y1~2 > 0 && ~y2~2 > 0);" "#res := 0;assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~y1~2 != ~y2~2);" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "assume true;" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" }, returnAlphabet = {"return;" "return;" }, states = {"320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "313#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "300#unseeded" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"300#unseeded" }, finalStates = {"320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" }, callTransitions = { ("300#unseeded" "call #t~ret2 := main();" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("300#unseeded" "call ULTIMATE.init();" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume true;" "321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume true;" "321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume true;" "321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume !!(~y1~2 != ~y2~2);" "321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("321#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") ("309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume !!(~y1~2 != ~y2~2);" "313#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))") ("309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "320#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") ("313#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("313#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "309#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("303#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "300#unseeded" "return;" "300#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~y1~2 != ~y2~2);" "assume true;" "assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume !(~y1~2 > 0 && ~y2~2 > 0);" "#res := 0;assume true;" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~y1~2 != ~y2~2);" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "assume true;" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" }, returnAlphabet = {"return;" "return;" }, states = {"690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "694#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "681#unseeded" "684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" }, initialStates = {"681#unseeded" }, finalStates = {"701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" }, callTransitions = { ("681#unseeded" "call #t~ret2 := main();" "684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("681#unseeded" "call ULTIMATE.init();" "684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume !!(~y1~2 != ~y2~2);" "694#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))") ("690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))" "assume true;" "701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") ("694#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "assume !(~y1~2 > ~y2~2);~y2~2 := ~y2~2 - ~y1~2;" "690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("694#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2) (distinct main_~y1~2 main_~y2~2))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~y1~2;havoc ~y2~2;~y1~2 := #t~nondet0;havoc #t~nondet0;~y2~2 := #t~nondet1;havoc #t~nondet1;assume ~y1~2 > 0 && ~y2~2 > 0;" "690#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y2~2))") ("684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume true;" "702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))" "assume true;" "702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume true;" "702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume !!(~y1~2 != ~y2~2);" "702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))") ("702#(and (<= 1 main_~y2~2) (<= main_~y1~2 (+ main_~y2~2 oldRank0)))" "assume ~y1~2 > ~y2~2;~y1~2 := ~y1~2 - ~y2~2;" "701#(and (<= 0 oldRank0) (<= (+ main_~y1~2 1) (+ main_~y2~2 oldRank0)) (<= 1 main_~y2~2))") }, returnTransitions = { ("684#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "681#unseeded" "return;" "681#unseeded") } ); 2019-05-11 07:09:15,839 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:15,840 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.7s and 5 iterations. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization removed 17 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 0 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 202 Sat,159 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Termination: inital15 mio100 ax100 hnf108 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf101 smp85 dnf100 smp100 tf105 neg100 sie100 Nontermination: inital15 mio100 ax100 hnf108 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf101 smp85 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 111ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:09:15,840 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:15,840 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:15,841 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:15,841 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:15,855 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 128.39 ms. Allocated memory is still 649.6 MB. Free memory was 615.6 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 119.50 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 28.75 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 226.74 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB * BlockEncoding took 68.08 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 125.23 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 578.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2810.56 ms. Allocated memory is still 649.6 MB. Free memory was 578.3 MB in the beginning and 483.6 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:15,882 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully