YES 2019-05-11 07:08:57,681 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:08:57,684 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:08:57,688 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:08:57,689 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:08:57,689 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:08:57,690 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:08:57,690 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:08:57,690 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:08:57,691 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:08:57,693 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:08:57,694 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:08:57,694 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:08:57,694 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:08:57,695 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:08:57,695 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:08:57,696 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:00,332 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:00,333 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:00,333 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:00,333 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:00,679 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:00,679 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:00,680 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:00,680 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:00,680 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:00,680 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:00,680 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:00,681 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:00,681 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:00,681 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:00,681 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:00,682 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:00,682 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:00,682 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:00,682 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:00,682 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:00,684 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:00,684 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:00,684 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:00,684 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:00,684 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:00,685 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:00,685 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:00,685 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:00,685 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:00,685 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:00,686 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:00,686 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:00,686 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:00,686 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:00,686 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:00,687 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:00,687 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:00,687 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:00,687 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:00,904 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:00,911 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:00,912 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:00,914 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:00,915 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:00,916 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:00,916 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:01,040 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:01,042 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:01,042 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:01,043 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:01,046 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:01,047 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:01" (1/1) ... 2019-05-11 07:09:01,155 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:01,156 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:01,156 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:01,156 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:01,171 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:01" (1/1) ... 2019-05-11 07:09:01,176 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:01" (1/1) ... 2019-05-11 07:09:01,176 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:01" (1/1) ... 2019-05-11 07:09:01,178 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:01" (1/1) ... 2019-05-11 07:09:01,179 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:01" (1/1) ... 2019-05-11 07:09:01,180 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:01" (1/1) ... 2019-05-11 07:09:01,181 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:01,182 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:01,182 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:01,182 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:01,183 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:01" (1/1) ... 2019-05-11 07:09:01,279 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:01,282 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:01,397 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:01,397 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:01,397 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:01,399 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:01,399 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:01" (1/1) ... 2019-05-11 07:09:01,413 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:01" (1/1) ... 2019-05-11 07:09:01,437 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:01,438 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:01,460 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:01,460 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:01,460 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:01,464 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:01,464 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:01" (1/5) ... 2019-05-11 07:09:01,466 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:01" (2/5) ... 2019-05-11 07:09:01,466 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:01" (3/5) ... 2019-05-11 07:09:01,466 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:01" (4/5) ... 2019-05-11 07:09:01,467 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:01" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:01,575 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:01,575 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:01,575 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:01,576 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:01,578 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:09:01" (1/1) ... 2019-05-11 07:09:03,754 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:03,755 INFO [Benchmark.java:150]: Toolchain (without parser) took 2714.67 ms. Allocated memory was 514.9 MB in the beginning and 570.9 MB in the end (delta: 56.1 MB). Free memory was 484.8 MB in the beginning and 506.1 MB in the end (delta: -21.4 MB). Peak memory consumption was 34.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,758 INFO [Benchmark.java:150]: CDTParser took 113.30 ms. Allocated memory is still 514.9 MB. Free memory was 491.5 MB in the beginning and 485.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,759 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.51 ms. Allocated memory is still 514.9 MB. Free memory was 484.8 MB in the beginning and 478.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,760 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 514.9 MB. Free memory was 478.7 MB in the beginning and 477.4 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:03,760 INFO [Benchmark.java:150]: RCFGBuilder took 215.42 ms. Allocated memory is still 514.9 MB. Free memory was 477.4 MB in the beginning and 465.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,761 INFO [Benchmark.java:150]: BlockEncoding took 62.53 ms. Allocated memory is still 514.9 MB. Free memory was 465.3 MB in the beginning and 461.3 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:03,762 INFO [Benchmark.java:150]: TraceAbstraction took 115.18 ms. Allocated memory is still 514.9 MB. Free memory was 461.3 MB in the beginning and 454.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,762 INFO [Benchmark.java:150]: BuchiAutomizer took 2179.33 ms. Allocated memory was 514.9 MB in the beginning and 570.9 MB in the end (delta: 56.1 MB). Free memory was 454.5 MB in the beginning and 506.1 MB in the end (delta: -51.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,769 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:03,769 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:03,769 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:03,770 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:03,770 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:03,770 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:03,770 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:09:03,770 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:03,770 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:09:03,770 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:03,771 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:03,771 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:03,771 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:03,771 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:03,771 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has 2-nested ranking function (if -2 * r + 2 * db + 0 > 0 then 1 else 0), (if -2 * r + 2 * db + 0 > 0 then -2 * r + 2 * db + 0 else 2 * da + -2 * r + 1) and consists of 6 locations. One deterministic module has affine ranking function -2 * r + 2 * da + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * r + 2 * da + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * da + -2 * r + 1 and consists of 5 locations. 2019-05-11 07:09:03,771 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:03,772 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~da~2 >= ~r~2);" "assume true;" "assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume !(~r~2 >= 0);" "#res := 0;assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "assume !true;" "assume true;" "assume true;" "assume !!(~da~2 >= ~r~2);" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "assume true;" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "57#unseeded" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "30#false" }, initialStates = {"57#unseeded" }, finalStates = {"66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))" "30#false" }, callTransitions = { ("57#unseeded" "call #t~ret2 := main();" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("57#unseeded" "call ULTIMATE.init();" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume !(~da~2 >= ~r~2);" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume !true;" "30#false") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume true;" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume true;" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume !!(~da~2 >= ~r~2);" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume true;" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))" "#res := 0;assume true;" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))" "assume !true;" "30#false") ("66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))" "assume true;" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))" "assume true;" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "assume !(~da~2 >= ~r~2);" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "assume !true;" "30#false") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "assume true;" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "assume true;" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "assume !!(~da~2 >= ~r~2);" "80#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (exists ((main_~da~2 Int)) (or (and (<= (* 2 main_~db~2) (+ oldRank1 (* 2 main_~r~2))) (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (<= 1 oldRank0)) (and (<= 0 oldRank0) (<= (+ (* 2 main_~da~2) 1) (+ oldRank1 (* 2 main_~r~2))) (<= main_~r~2 main_~da~2) (<= (* 2 main_~db~2) (* 2 main_~r~2))))))") ("67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))" "#res := 0;assume true;" "67#(and (>= oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)))") ("57#unseeded" "assume true;" "57#unseeded") ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "66#(or (and (<= 0 oldRank0) (> oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0))) (and (>= oldRank0 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) 1 0)) (> oldRank1 (ite (<= (+ (* 2 main_~r~2) 1) (* 2 main_~db~2)) (+ 0 (* 2 main_~db~2) (* main_~r~2 (- 2))) (+ (* 2 main_~da~2) 1 (* main_~r~2 (- 2))))) (<= 0 oldRank1)))") ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume !(~r~2 >= 0);" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("30#false" "assume true;" "30#false") ("30#false" "assume true;" "30#false") ("30#false" "#res := 0;assume true;" "30#false") }, returnTransitions = { ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "57#unseeded" "return;" "57#unseeded") ("60#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "57#unseeded" "return;" "57#unseeded") ("30#false" "57#unseeded" "return;" "30#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~da~2 >= ~r~2);" "assume true;" "assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume !(~r~2 >= 0);" "#res := 0;assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "assume !true;" "assume true;" "assume true;" "assume !!(~da~2 >= ~r~2);" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "assume true;" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"176#unseeded" "179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "187#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "191#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" }, initialStates = {"176#unseeded" }, finalStates = {"186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" }, callTransitions = { ("176#unseeded" "call #t~ret2 := main();" "179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("176#unseeded" "call ULTIMATE.init();" "179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") ("186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume !!(~da~2 >= ~r~2);" "191#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))") ("186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume true;" "187#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("187#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume true;" "187#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("187#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume !!(~da~2 >= ~r~2);" "191#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))") ("191#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "186#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") }, returnTransitions = { ("179#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "176#unseeded" "return;" "176#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~da~2 >= ~r~2);" "assume true;" "assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume !(~r~2 >= 0);" "#res := 0;assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "assume !true;" "assume true;" "assume true;" "assume !!(~da~2 >= ~r~2);" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "assume true;" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "302#unseeded" "318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "334#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" }, initialStates = {"302#unseeded" }, finalStates = {"317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" }, callTransitions = { ("302#unseeded" "call #t~ret2 := main();" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("302#unseeded" "call ULTIMATE.init();" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~da~2 >= ~r~2);" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume true;" "318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume true;" "318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume true;" "318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("318#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume !!(~da~2 >= ~r~2);" "334#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))") ("334#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "317#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") }, returnTransitions = { ("305#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "302#unseeded" "return;" "302#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~da~2 >= ~r~2);" "assume true;" "assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume !(~r~2 >= 0);" "#res := 0;assume true;" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "assume !true;" "assume true;" "assume true;" "assume !!(~da~2 >= ~r~2);" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "assume true;" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"720#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" "709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "694#unseeded" "710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"694#unseeded" }, finalStates = {"709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" }, callTransitions = { ("694#unseeded" "call #t~ret2 := main();" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("694#unseeded" "call ULTIMATE.init();" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("720#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") ("709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume true;" "710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))" "assume true;" "710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume true;" "710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))") ("710#(<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2)))" "assume !!(~da~2 >= ~r~2);" "720#(and (<= main_~r~2 main_~da~2) (<= (+ (* 2 main_~da~2) 1) (+ oldRank0 (* 2 main_~r~2))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~da~2;havoc ~db~2;havoc ~temp~2;~r~2 := #t~nondet0;havoc #t~nondet0;assume ~r~2 >= 0;~da~2 := 2 * ~r~2;~db~2 := 2 * ~r~2;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~da~2 >= ~r~2);" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(#t~nondet1 != 0);havoc #t~nondet1;~temp~2 := ~da~2;~da~2 := ~db~2 - 1;~db~2 := ~da~2;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "709#(and (<= (+ (* 2 main_~da~2) 2) (+ oldRank0 (* 2 main_~r~2))) (<= 0 oldRank0))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume #t~nondet1 != 0;havoc #t~nondet1;~da~2 := ~da~2 - 1;" "697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("697#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "694#unseeded" "return;" "694#unseeded") } ); 2019-05-11 07:09:03,773 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:03,774 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.1s and 5 iterations. Analysis of lassos took 0.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization removed 20 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, 195 Sat,152 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.3s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital15 mio100 ax100 hnf94 lsp78 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital15 mio100 ax100 hnf94 lsp78 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 2019-05-11 07:09:03,774 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:03,774 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:03,774 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:03,775 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:03,781 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 113.30 ms. Allocated memory is still 514.9 MB. Free memory was 491.5 MB in the beginning and 485.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.51 ms. Allocated memory is still 514.9 MB. Free memory was 484.8 MB in the beginning and 478.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.72 ms. Allocated memory is still 514.9 MB. Free memory was 478.7 MB in the beginning and 477.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 215.42 ms. Allocated memory is still 514.9 MB. Free memory was 477.4 MB in the beginning and 465.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 53.1 GB * BlockEncoding took 62.53 ms. Allocated memory is still 514.9 MB. Free memory was 465.3 MB in the beginning and 461.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 115.18 ms. Allocated memory is still 514.9 MB. Free memory was 461.3 MB in the beginning and 454.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2179.33 ms. Allocated memory was 514.9 MB in the beginning and 570.9 MB in the end (delta: 56.1 MB). Free memory was 454.5 MB in the beginning and 506.1 MB in the end (delta: -51.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:03,807 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully