YES 2019-05-11 07:10:40,203 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:10:40,207 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:10:40,211 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:10:40,211 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:10:40,212 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:10:40,212 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:10:40,213 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:10:40,213 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:10:40,213 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:10:40,216 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:10:40,217 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:10:40,217 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:10:40,217 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:10:40,218 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:10:40,218 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:10:40,219 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:10:42,313 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:10:42,313 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:10:42,314 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:10:42,314 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:10:42,709 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:10:42,710 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:10:42,710 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:10:42,710 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:10:42,711 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,711 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:10:42,711 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:10:42,711 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:10:42,712 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:10:42,712 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:10:42,712 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:10:42,712 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:10:42,713 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:10:42,713 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:10:42,713 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:10:42,713 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:10:42,713 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:10:42,714 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:10:42,714 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:10:42,714 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:10:42,722 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:10:42,723 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:10:42,723 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:10:42,723 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:10:42,723 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:10:42,723 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:10:42,724 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:10:42,724 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:10:42,724 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:10:42,724 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:10:42,725 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,725 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,725 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:10:42,725 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:10:42,726 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:10:43,033 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:10:43,043 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:43,044 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:10:43,046 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:10:43,048 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:10:43,049 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:10:43,049 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:10:43,194 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:10:43,196 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:10:43,196 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:43,196 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:10:43,200 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:10:43,201 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:43,320 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:10:43,321 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:10:43,321 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:10:43,321 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:10:43,338 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:10:43" (1/1) ... 2019-05-11 07:10:43,343 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:10:43" (1/1) ... 2019-05-11 07:10:43,343 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:10:43" (1/1) ... 2019-05-11 07:10:43,345 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:10:43" (1/1) ... 2019-05-11 07:10:43,347 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:10:43" (1/1) ... 2019-05-11 07:10:43,348 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:10:43" (1/1) ... 2019-05-11 07:10:43,349 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:10:43,349 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:10:43,349 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:10:43,349 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:10:43,351 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:43,453 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:10:43,456 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:10:43,597 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:10:43,597 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:10:43,597 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:10:43,599 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:10:43,599 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:43,614 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:43,655 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,656 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,657 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,658 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:10:43,666 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:10:43,667 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:10:43,667 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:10:43,669 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:10:43,669 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:10:43" (1/5) ... 2019-05-11 07:10:43,671 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:10:43" (2/5) ... 2019-05-11 07:10:43,671 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:10:43" (3/5) ... 2019-05-11 07:10:43,672 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:10:43" (4/5) ... 2019-05-11 07:10:43,672 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:10:43" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:10:43,772 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:10:43,773 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:10:43,773 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:10:43,773 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:10:43,776 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:10:43" (1/1) ... 2019-05-11 07:10:46,112 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:10:46,113 INFO [Benchmark.java:150]: Toolchain (without parser) took 2918.57 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 563.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 53.1 GB 2019-05-11 07:10:46,115 INFO [Benchmark.java:150]: CDTParser took 132.46 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:10:46,117 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 124.26 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:10:46,117 INFO [Benchmark.java:150]: Boogie Preprocessor took 28.42 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:10:46,118 INFO [Benchmark.java:150]: RCFGBuilder took 247.83 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 587.0 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 53.1 GB 2019-05-11 07:10:46,119 INFO [Benchmark.java:150]: BlockEncoding took 68.99 ms. Allocated memory is still 649.6 MB. Free memory was 587.0 MB in the beginning and 583.0 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:10:46,120 INFO [Benchmark.java:150]: TraceAbstraction took 105.92 ms. Allocated memory is still 649.6 MB. Free memory was 583.0 MB in the beginning and 576.2 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:10:46,120 INFO [Benchmark.java:150]: BuchiAutomizer took 2339.31 ms. Allocated memory is still 649.6 MB. Free memory was 576.2 MB in the beginning and 563.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:46,127 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:10:46,128 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:10:46,128 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:10:46,128 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:10:46,128 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:10:46,129 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:10:46,129 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:10:46,129 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:10:46,129 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 25]: Loop Invariant 2019-05-11 07:10:46,129 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:10:46,130 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:10:46,130 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:10:46,130 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:10:46,130 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:10:46,130 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + 0 and consists of 5 locations. One deterministic module has affine ranking function y + 0 and consists of 5 locations. One deterministic module has affine ranking function 2 * r + -2 * y + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * r + -2 * y + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. 2019-05-11 07:10:46,130 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:10:46,131 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "assume true;assume !(~r~2 >= ~y~2);" "~x~2 := ~y~2;~y~2 := ~r~2;" "assume true;assume !(~y~2 > 0);" "#res := 0;assume true;" "assume !true;" "assume !true;" "assume true;" "assume ~y~2 < 0;~y~2 := -~y~2;" "assume true;" "assume ~x~2 < 0;~x~2 := -~x~2;" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 < 0);" "assume !(~y~2 < 0);" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"96#unseeded" "113#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "119#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" "108#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, initialStates = {"96#unseeded" }, finalStates = {"108#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("96#unseeded" "call #t~ret2 := main();" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("96#unseeded" "call ULTIMATE.init();" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("113#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "113#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("113#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !(~r~2 >= ~y~2);" "119#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 < 0;~y~2 := -~y~2;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~r~2 >= ~y~2);" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < 0;~x~2 := -~x~2;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~y~2;~y~2 := ~r~2;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < 0);" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "108#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("119#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" "~x~2 := ~y~2;~y~2 := ~r~2;" "108#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("108#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "113#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") }, returnTransitions = { ("99#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "96#unseeded" "return;" "96#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "assume true;assume !(~r~2 >= ~y~2);" "~x~2 := ~y~2;~y~2 := ~r~2;" "assume true;assume !(~y~2 > 0);" "#res := 0;assume true;" "assume !true;" "assume !true;" "assume true;" "assume ~y~2 < 0;~y~2 := -~y~2;" "assume true;" "assume ~x~2 < 0;~x~2 := -~x~2;" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 < 0);" "assume !(~y~2 < 0);" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"210#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" "198#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "187#unseeded" "203#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"187#unseeded" }, finalStates = {"198#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("187#unseeded" "call #t~ret2 := main();" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("187#unseeded" "call ULTIMATE.init();" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("210#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))" "~x~2 := ~y~2;~y~2 := ~r~2;" "198#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("198#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "203#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("203#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "203#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))") ("203#(and (<= main_~y~2 oldRank0) (<= 1 main_~y~2))" "assume true;assume !(~r~2 >= ~y~2);" "210#(and (<= (+ main_~r~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~y~2) (<= 1 oldRank0))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 < 0;~y~2 := -~y~2;" "198#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~r~2 >= ~y~2);" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < 0;~x~2 := -~x~2;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~y~2;~y~2 := ~r~2;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < 0);" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("190#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "187#unseeded" "return;" "187#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "assume true;assume !(~r~2 >= ~y~2);" "~x~2 := ~y~2;~y~2 := ~r~2;" "assume true;assume !(~y~2 > 0);" "#res := 0;assume true;" "assume !true;" "assume !true;" "assume true;" "assume ~y~2 < 0;~y~2 := -~y~2;" "assume true;" "assume ~x~2 < 0;~x~2 := -~x~2;" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 < 0);" "assume !(~y~2 < 0);" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "292#(and (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 1) (+ (* 2 main_~y~2) oldRank0)))" "278#unseeded" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"278#unseeded" }, finalStates = {"291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("278#unseeded" "call #t~ret2 := main();" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("278#unseeded" "call ULTIMATE.init();" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~r~2 >= ~y~2);" "292#(and (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 1) (+ (* 2 main_~y~2) oldRank0)))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 < 0;~y~2 := -~y~2;" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < 0;~x~2 := -~x~2;" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < 0);" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "291#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))") }, returnTransitions = { ("281#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "278#unseeded" "return;" "278#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "assume true;assume !(~r~2 >= ~y~2);" "~x~2 := ~y~2;~y~2 := ~r~2;" "assume true;assume !(~y~2 > 0);" "#res := 0;assume true;" "assume !true;" "assume !true;" "assume true;" "assume ~y~2 < 0;~y~2 := -~y~2;" "assume true;" "assume ~x~2 < 0;~x~2 := -~x~2;" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume !(~x~2 < 0);" "assume !(~y~2 < 0);" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" }, returnAlphabet = {"return;" "return;" }, states = {"513#unseeded" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "527#(and (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 1) (+ (* 2 main_~y~2) oldRank0)))" }, initialStates = {"513#unseeded" }, finalStates = {"526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" }, callTransitions = { ("513#unseeded" "call #t~ret2 := main();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("513#unseeded" "call ULTIMATE.init();" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~y~2 < 0;~y~2 := -~y~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~r~2 >= ~y~2);" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < 0;~x~2 := -~x~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~y~2;~y~2 := ~r~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~r~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < 0);" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 > 0);~r~2 := ~x~2;" "526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !!(~r~2 >= ~y~2);~r~2 := ~r~2 - ~y~2;" "526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))") ("526#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 2) (+ (* 2 main_~y~2) oldRank0)))" "assume true;assume !(~r~2 >= ~y~2);" "527#(and (<= 1 main_~y~2) (<= (+ (* 2 main_~r~2) 1) (+ (* 2 main_~y~2) oldRank0)))") }, returnTransitions = { ("516#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "513#unseeded" "return;" "513#unseeded") } ); 2019-05-11 07:10:46,131 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:10:46,132 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.3s and 6 iterations. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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 15 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 15 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 105 Sat,153 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital15 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf106 neg100 sie100 Nontermination: inital15 mio100 ax100 hnf102 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 51ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:10:46,132 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:10:46,133 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:10:46,133 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:10:46,133 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:10:46,142 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 132.46 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 611.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 124.26 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 28.42 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 247.83 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 587.0 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 53.1 GB * BlockEncoding took 68.99 ms. Allocated memory is still 649.6 MB. Free memory was 587.0 MB in the beginning and 583.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 105.92 ms. Allocated memory is still 649.6 MB. Free memory was 583.0 MB in the beginning and 576.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2339.31 ms. Allocated memory is still 649.6 MB. Free memory was 576.2 MB in the beginning and 563.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 53.1 GB 2019-05-11 07:10:46,171 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully