YES 2019-05-11 07:09:54,645 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:54,648 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:54,652 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:54,652 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:54,653 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:54,654 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:54,654 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:54,654 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:54,655 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:54,657 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:54,657 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:54,658 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:54,658 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:54,658 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:54,658 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:54,660 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:56,548 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:56,548 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:56,564 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:56,564 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:56,924 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:56,924 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:56,925 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:56,925 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:56,925 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:56,925 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:56,926 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:56,926 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:56,926 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:56,926 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:56,926 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:56,927 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:56,927 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:56,927 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:56,927 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:56,927 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:56,928 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:56,928 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:56,928 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:56,928 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:56,928 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:56,929 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:56,929 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:56,929 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:56,929 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:56,929 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:56,929 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:56,930 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:56,930 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:56,930 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:56,930 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:56,930 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:56,931 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:56,931 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:56,931 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:57,153 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:57,160 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:57,160 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:57,162 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:57,164 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:57,164 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:57,164 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:57,289 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:57,290 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:57,291 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:57,291 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:57,294 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:57,295 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:57" (1/1) ... 2019-05-11 07:09:57,403 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:57,403 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:57,404 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:57,404 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:57,420 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:57" (1/1) ... 2019-05-11 07:09:57,424 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:57" (1/1) ... 2019-05-11 07:09:57,424 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:57" (1/1) ... 2019-05-11 07:09:57,426 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:57" (1/1) ... 2019-05-11 07:09:57,427 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:57" (1/1) ... 2019-05-11 07:09:57,428 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:57" (1/1) ... 2019-05-11 07:09:57,429 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:57,430 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:57,430 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:57,430 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:57,431 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:57" (1/1) ... 2019-05-11 07:09:57,530 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:57,533 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:57,640 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:57,640 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:57,640 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:57,641 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:57,642 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:57" (1/1) ... 2019-05-11 07:09:57,655 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:57" (1/1) ... 2019-05-11 07:09:57,672 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:57,673 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:57,694 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:57,695 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:57,695 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:57,696 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:57,696 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:57" (1/5) ... 2019-05-11 07:09:57,697 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:57" (2/5) ... 2019-05-11 07:09:57,698 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:57" (3/5) ... 2019-05-11 07:09:57,698 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:57" (4/5) ... 2019-05-11 07:09:57,699 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:57" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:57,793 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:57,793 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:57,794 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:57,794 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:57,796 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:57" (1/1) ... 2019-05-11 07:09:59,503 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:59,504 INFO [Benchmark.java:150]: Toolchain (without parser) took 2214.95 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 604.1 MB in the beginning and 608.1 MB in the end (delta: -4.0 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:59,506 INFO [Benchmark.java:150]: CDTParser took 113.55 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 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:59,507 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.39 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 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:59,508 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.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:59,509 INFO [Benchmark.java:150]: RCFGBuilder took 210.29 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:59,510 INFO [Benchmark.java:150]: BlockEncoding took 54.49 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 578.5 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:59,511 INFO [Benchmark.java:150]: TraceAbstraction took 98.46 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 573.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:59,511 INFO [Benchmark.java:150]: BuchiAutomizer took 1710.18 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 573.2 MB in the beginning and 608.1 MB in the end (delta: -34.9 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:59,520 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:59,520 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:59,520 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:59,520 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:59,520 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:59,521 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:59,521 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:09:59,521 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:59,521 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:09:59,521 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:59,521 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:59,522 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:59,522 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:59,522 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:59,522 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:59,522 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:59,523 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "assume true;" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 < ~y~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "26#false" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" }, initialStates = {"52#unseeded" }, finalStates = {"26#false" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("52#unseeded" "call #t~ret4 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(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") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume !true;" "26#false") ("61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "61#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~x~2 < ~y~2);" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !true;" "26#false") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "#res := 0;assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "62#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("26#false" "52#unseeded" "return;" "26#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "assume true;" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 < ~y~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "167#unseeded" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"167#unseeded" }, finalStates = {"181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("167#unseeded" "call #t~ret4 := main();" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("167#unseeded" "call ULTIMATE.init();" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume true;" "182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "182#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "181#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("170#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "167#unseeded" "return;" "167#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "assume true;" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 < ~y~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"496#unseeded" "512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "511#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, initialStates = {"496#unseeded" }, finalStates = {"511#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" }, callTransitions = { ("496#unseeded" "call #t~ret4 := main();" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#unseeded" "call ULTIMATE.init();" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "511#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume true;" "512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "511#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("511#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) (+ (* 2 main_~z~2) oldRank0)))" "assume true;" "512#(<= (+ (* 2 main_~x~2) 1) (+ (* 2 main_~z~2) oldRank0))") }, returnTransitions = { ("499#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "496#unseeded" "return;" "496#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "assume true;" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "assume !(~x~2 < ~y~2);" "assume !true;" "#res := 0;assume true;" "assume true;" "assume true;" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"634#unseeded" "650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "651#(<= main_~y~2 (+ main_~x~2 oldRank0))" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" }, initialStates = {"634#unseeded" }, finalStates = {"650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("634#unseeded" "call #t~ret4 := main();" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("634#unseeded" "call ULTIMATE.init();" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "651#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "651#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("651#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume true;" "651#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("651#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~z~2;havoc ~i~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~z~2 := #t~nondet2;havoc #t~nondet2;~i~2 := #t~nondet3;havoc #t~nondet3;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume !(~z~2 > ~x~2);~z~2 := ~z~2 + 1;" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume true;" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume ~z~2 > ~x~2;~x~2 := ~x~2 + 1;" "650#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume true;" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") ("670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))" "assume !!(~x~2 < ~y~2);~i~2 := ~i~2 + 1;" "670#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~x~2 1) main_~y~2))") }, returnTransitions = { ("637#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "634#unseeded" "return;" "634#unseeded") } ); 2019-05-11 07:09:59,523 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:59,524 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.8s. 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:59,524 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:59,524 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:59,524 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:59,524 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:59,531 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 113.55 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.39 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 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.86 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 210.29 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB * BlockEncoding took 54.49 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 578.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.46 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 573.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1710.18 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 573.2 MB in the beginning and 608.1 MB in the end (delta: -34.9 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:59,557 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully