YES 2019-05-11 07:08:59,563 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:08:59,566 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:08:59,570 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:08:59,570 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:08:59,571 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:08:59,572 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:08:59,572 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:08:59,572 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:08:59,573 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:08:59,575 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:08:59,576 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:08:59,576 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:08:59,576 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:08:59,576 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:08:59,577 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:08:59,578 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:02,790 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:02,790 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:02,790 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:02,791 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:03,169 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:03,170 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:03,170 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:03,171 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:03,171 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:03,171 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:03,171 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:03,171 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:03,172 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:03,172 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:03,172 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:03,172 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:03,173 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:03,173 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:03,173 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:03,173 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:03,175 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:03,175 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:03,175 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:03,175 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:03,176 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:03,176 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:03,176 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:03,176 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:03,177 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:03,177 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:03,177 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:03,177 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:03,177 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:03,178 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:03,178 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:03,178 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:03,178 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:03,179 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:03,179 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:03,412 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:03,422 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:03,422 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:03,425 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:03,426 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:03,427 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:03,427 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:03,556 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:03,558 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:03,559 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:03,559 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:03,563 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:03,564 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:03" (1/1) ... 2019-05-11 07:09:03,671 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:03,672 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:03,672 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:03,672 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:03,688 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:03" (1/1) ... 2019-05-11 07:09:03,692 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:03" (1/1) ... 2019-05-11 07:09:03,693 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:03" (1/1) ... 2019-05-11 07:09:03,694 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:03" (1/1) ... 2019-05-11 07:09:03,695 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:03" (1/1) ... 2019-05-11 07:09:03,696 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:03" (1/1) ... 2019-05-11 07:09:03,697 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:03,698 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:03,698 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:03,698 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:03,699 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:03" (1/1) ... 2019-05-11 07:09:03,792 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:03,794 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:03,897 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:03,897 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:03,897 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:03,898 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:03,899 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:03" (1/1) ... 2019-05-11 07:09:03,911 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:03" (1/1) ... 2019-05-11 07:09:03,928 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:03,929 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:03,950 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:03,950 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:03,950 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:03,952 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:03,952 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:03" (1/5) ... 2019-05-11 07:09:03,953 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:03" (2/5) ... 2019-05-11 07:09:03,953 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:03" (3/5) ... 2019-05-11 07:09:03,954 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:03" (4/5) ... 2019-05-11 07:09:03,954 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:03" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:04,044 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:04,045 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:04,045 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:04,045 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:04,047 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:04" (1/1) ... 2019-05-11 07:09:05,717 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:05,718 INFO [Benchmark.java:150]: Toolchain (without parser) took 2161.56 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 363.7 MB in the end (delta: 246.6 MB). Peak memory consumption was 246.6 MB. Max. memory is 53.1 GB 2019-05-11 07:09:05,720 INFO [Benchmark.java:150]: CDTParser took 117.54 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 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:05,721 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 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:05,722 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.41 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 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:05,723 INFO [Benchmark.java:150]: RCFGBuilder took 199.34 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:05,724 INFO [Benchmark.java:150]: BlockEncoding took 52.96 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 585.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:05,724 INFO [Benchmark.java:150]: TraceAbstraction took 94.25 ms. Allocated memory is still 649.6 MB. Free memory was 585.7 MB in the beginning and 578.9 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:05,725 INFO [Benchmark.java:150]: BuchiAutomizer took 1673.04 ms. Allocated memory is still 649.6 MB. Free memory was 578.9 MB in the beginning and 363.7 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 53.1 GB 2019-05-11 07:09:05,731 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:05,732 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:05,732 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:05,732 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:05,732 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:05,732 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:05,733 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:09:05,733 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:05,733 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 11]: Loop Invariant 2019-05-11 07:09:05,733 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:05,733 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:05,733 INFO [BasicToolchainJob.java:95]: CFG has 13 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 13 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:05,734 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:05,734 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:05,734 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 2 * x + -2 * z + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x + y + 0 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 4 locations. 2019-05-11 07:09:05,734 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:05,735 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "assume true;" "~c~2 := ~c~2 + 1;" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "assume !true;" "assume !(~x~2 < ~y~2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);" }, returnAlphabet = {"return;" "return;" }, states = {"51#unseeded" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "26#false" "60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" }, initialStates = {"51#unseeded" }, finalStates = {"26#false" "60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("51#unseeded" "call #t~ret3 := main();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("51#unseeded" "call ULTIMATE.init();" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("26#false" "assume true;" "26#false") ("26#false" "#res := 0;assume true;" "26#false") ("60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "~c~2 := ~c~2 + 1;" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume !true;" "26#false") ("60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume true;" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "60#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~x~2 < ~y~2);" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !true;" "26#false") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "#res := 0;assume true;" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);" "61#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") }, returnTransitions = { ("54#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "51#unseeded" "return;" "51#unseeded") ("26#false" "51#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "assume true;" "~c~2 := ~c~2 + 1;" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "assume !true;" "assume !(~x~2 < ~y~2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);" }, returnAlphabet = {"return;" "return;" }, states = {"179#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "164#unseeded" "180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"164#unseeded" }, finalStates = {"179#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("164#unseeded" "call #t~ret3 := main();" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("164#unseeded" "call ULTIMATE.init();" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("179#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "~c~2 := ~c~2 + 1;" "180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "179#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);" "180#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~c~2 := ~c~2 + 1;" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "179#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);" "167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("167#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "164#unseeded" "return;" "164#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "assume true;" "~c~2 := ~c~2 + 1;" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "assume !true;" "assume !(~x~2 < ~y~2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);" }, returnAlphabet = {"return;" "return;" }, states = {"501#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "487#unseeded" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"487#unseeded" }, finalStates = {"501#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("487#unseeded" "call #t~ret3 := main();" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("487#unseeded" "call ULTIMATE.init();" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("501#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "~c~2 := ~c~2 + 1;" "502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "501#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);" "502#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~c~2 := ~c~2 + 1;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "501#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);" "490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("490#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "487#unseeded" "return;" "487#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret3 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "assume true;" "~c~2 := ~c~2 + 1;" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "assume !true;" "assume !(~x~2 < ~y~2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);" }, returnAlphabet = {"return;" "return;" }, states = {"640#(<= main_~y~2 (+ main_~x~2 oldRank0))" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "623#unseeded" "639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, initialStates = {"623#unseeded" }, finalStates = {"639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("623#unseeded" "call #t~ret3 := main();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("623#unseeded" "call ULTIMATE.init();" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("640#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume true;" "640#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("640#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 < ~y~2);" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~c~2 := ~c~2 + 1;" "639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;havoc ~z~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~c~2 := 0;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);" "626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume !(~x~2 < ~z~2);~z~2 := ~z~2 + 1;" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "~c~2 := ~c~2 + 1;" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume ~x~2 < ~z~2;~x~2 := ~x~2 + 1;" "639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume true;" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume !!(~x~2 < ~y~2);" "659#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "~c~2 := ~c~2 + 1;" "640#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("639#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "640#(<= main_~y~2 (+ main_~x~2 oldRank0))") }, returnTransitions = { ("626#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "623#unseeded" "return;" "623#unseeded") } ); 2019-05-11 07:09:05,735 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:05,736 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.6s and 5 iterations. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization removed 10 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 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, 138 Sat,138 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf109 lsp75 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq138 hnf95 smp100 dnf100 smp100 tf109 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf109 lsp75 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq138 hnf95 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:09:05,736 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:05,737 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:05,737 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:05,737 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:05,758 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 117.54 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 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 25.41 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 199.34 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB * BlockEncoding took 52.96 ms. Allocated memory is still 649.6 MB. Free memory was 588.4 MB in the beginning and 585.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 53.1 GB * TraceAbstraction took 94.25 ms. Allocated memory is still 649.6 MB. Free memory was 585.7 MB in the beginning and 578.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1673.04 ms. Allocated memory is still 649.6 MB. Free memory was 578.9 MB in the beginning and 363.7 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 53.1 GB 2019-05-11 07:09:05,784 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully