YES 2019-05-11 07:09:43,444 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:43,447 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:43,451 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:43,451 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:43,452 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:43,452 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:43,452 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:43,453 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:43,453 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:43,455 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:43,456 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:43,456 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:43,456 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:43,456 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:43,457 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:43,458 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:45,933 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:45,933 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:45,933 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:45,933 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:46,283 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:46,283 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:46,284 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:46,284 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:46,284 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:46,284 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:46,284 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:46,285 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:46,285 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:46,285 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:46,285 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:46,285 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:46,286 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:46,286 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:46,286 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:46,286 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:46,286 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:46,287 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:46,287 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:46,287 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:46,287 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:46,288 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:46,288 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:46,288 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:46,288 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:46,288 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:46,288 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:46,289 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:46,289 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:46,289 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:46,289 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:46,289 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:46,290 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:46,290 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:46,290 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:46,507 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:46,514 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:46,515 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:46,517 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:46,519 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:46,519 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:46,519 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:46,643 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:46,645 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:46,645 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:46,645 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:46,648 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:46,649 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:46" (1/1) ... 2019-05-11 07:09:46,756 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:46,756 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:46,756 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:46,757 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:46,772 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:46" (1/1) ... 2019-05-11 07:09:46,777 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:46" (1/1) ... 2019-05-11 07:09:46,777 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:46" (1/1) ... 2019-05-11 07:09:46,779 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:46" (1/1) ... 2019-05-11 07:09:46,780 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:46" (1/1) ... 2019-05-11 07:09:46,781 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:46" (1/1) ... 2019-05-11 07:09:46,782 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:46,782 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:46,782 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:46,782 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:46,784 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:46" (1/1) ... 2019-05-11 07:09:46,881 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:46,883 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:46,999 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:47,000 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:47,000 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:47,001 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:47,001 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:46" (1/1) ... 2019-05-11 07:09:47,016 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:46" (1/1) ... 2019-05-11 07:09:47,053 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:47,054 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:47,055 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:47,056 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:47,057 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:47,057 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:47,057 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:47,059 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:47,059 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:46" (1/5) ... 2019-05-11 07:09:47,060 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:47" (2/5) ... 2019-05-11 07:09:47,061 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:47" (3/5) ... 2019-05-11 07:09:47,061 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:46" (4/5) ... 2019-05-11 07:09:47,061 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:46" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:47,161 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:47,161 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:47,162 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:47,162 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:47,165 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:47" (1/1) ... 2019-05-11 07:09:54,376 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:54,377 INFO [Benchmark.java:150]: Toolchain (without parser) took 7733.42 ms. Allocated memory was 643.3 MB in the beginning and 744.5 MB in the end (delta: 101.2 MB). Free memory was 604.1 MB in the beginning and 715.4 MB in the end (delta: -111.3 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:54,380 INFO [Benchmark.java:150]: CDTParser took 112.87 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:54,381 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.04 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:54,381 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.60 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:54,382 INFO [Benchmark.java:150]: RCFGBuilder took 217.33 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:54,383 INFO [Benchmark.java:150]: BlockEncoding took 57.44 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:54,384 INFO [Benchmark.java:150]: TraceAbstraction took 103.98 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 571.8 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:54,385 INFO [Benchmark.java:150]: BuchiAutomizer took 7214.76 ms. Allocated memory was 643.3 MB in the beginning and 744.5 MB in the end (delta: 101.2 MB). Free memory was 571.8 MB in the beginning and 715.4 MB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:54,391 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:54,391 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:54,392 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:54,392 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:54,392 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:54,392 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:54,392 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:09:54,392 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 12]: Loop Invariant 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 10]: Loop Invariant 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:54,393 INFO [BasicToolchainJob.java:95]: CFG has 12 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 12 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:54,394 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:54,394 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:54,394 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (3 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * y + 5 and consists of 13 locations. One nondeterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. 2019-05-11 07:09:54,394 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:54,394 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "150#unseeded" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"150#unseeded" }, finalStates = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("150#unseeded" "call #t~ret2 := main();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("150#unseeded" "call ULTIMATE.init();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "150#unseeded" "return;" "150#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "150#unseeded" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"150#unseeded" }, finalStates = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("150#unseeded" "call #t~ret2 := main();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("150#unseeded" "call ULTIMATE.init();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "150#unseeded" "return;" "150#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "77#unseeded" }, initialStates = {"77#unseeded" }, finalStates = {"86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("77#unseeded" "call #t~ret2 := main();" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("77#unseeded" "call ULTIMATE.init();" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !(~x~2 > ~y~2);" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") }, returnTransitions = { ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "77#unseeded" "return;" "77#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "150#unseeded" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"150#unseeded" }, finalStates = {"161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("150#unseeded" "call #t~ret2 := main();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("150#unseeded" "call ULTIMATE.init();" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "162#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "161#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("153#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "150#unseeded" "return;" "150#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"546#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0))" "579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "548#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))" "551#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))" "554#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "558#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))" "536#unseeded" "568#(and (<= main_~x~2 3) (<= 5 (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "569#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "574#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" }, initialStates = {"536#unseeded" }, finalStates = {"546#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0))" "567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))" }, callTransitions = { ("536#unseeded" "call #t~ret2 := main();" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("536#unseeded" "call ULTIMATE.init();" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !(~x~2 > ~y~2);" "579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "~x~2 := ~x~2 - 1;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("548#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "551#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))") ("551#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "554#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("554#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("554#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~x~2 > ~y~2);" "558#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("558#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "~x~2 := ~x~2 - 1;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "569#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))") ("567#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0) (<= main_~x~2 3) (<= 1 main_~y~2))" "assume true;assume !(~x~2 > ~y~2);" "568#(and (<= main_~x~2 3) (<= 5 (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("568#(and (<= main_~x~2 3) (<= 5 (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "568#(and (<= main_~x~2 3) (<= 5 (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("569#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "574#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~x~2 > ~y~2);" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "546#(and (<= 6 (+ (* 2 main_~y~2) oldRank0)) (<= 0 oldRank0))") ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "548#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= main_~y~2 1) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))))") ("574#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_main_~y~2_63 Int)) (and unseeded (<= main_~y~2 (* 2 v_main_~y~2_63)) (<= v_main_~y~2_63 1))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "579#(and (exists ((v_main_~y~2_64 Int) (v_nnf_13 Int)) (and (<= v_nnf_13 1) unseeded (<= v_main_~y~2_64 (* 2 v_nnf_13)) (<= main_~y~2 (* 2 v_main_~y~2_64)))) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (exists ((v_nnf_16 Int) (v_nnf_17 Int)) (and (<= (+ main_~x~2 1) (* 2 v_nnf_17)) (<= v_nnf_16 1) unseeded (<= v_nnf_17 (* 2 v_nnf_16)))) (exists ((v_nnf_15 Int) (v_nnf_14 Int)) (and (<= v_nnf_14 (* 2 v_nnf_15)) (<= v_nnf_15 1) unseeded (<= main_~x~2 (* 2 v_nnf_14)))))") }, returnTransitions = { ("539#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "536#unseeded" "return;" "536#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration7 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "assume !true;" "assume true;assume !(~x~2 > ~y~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "853#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "841#unseeded" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"841#unseeded" }, finalStates = {"852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("841#unseeded" "call #t~ret2 := main();" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("841#unseeded" "call ULTIMATE.init();" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~x~2 > ~y~2);" "853#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("853#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "853#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > ~y~2);~y~2 := 2 * ~y~2;~c~2 := ~c~2 + 1;" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~x~2 > ~y~2);" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "852#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("844#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "841#unseeded" "return;" "841#unseeded") } ); 2019-05-11 07:09:54,396 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:54,396 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 7.1s and 8 iterations. Analysis of lassos took 1.4s. Construction of modules took 1.2s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization removed 12 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 2/6 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 27 SDtfs, 5 SDslu, 30 SDs, 0 lazy, 290 Sat,179 Unsat,2 Unknown,0 NotChecked. HoareTripleCheck time: 1.2s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf109 lsp74 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf109 lsp74 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 100ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:09:54,397 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:54,397 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:54,397 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:54,397 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:54,403 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 112.87 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 111.04 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.60 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 217.33 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 57.44 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 103.98 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 571.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 7214.76 ms. Allocated memory was 643.3 MB in the beginning and 744.5 MB in the end (delta: 101.2 MB). Free memory was 571.8 MB in the beginning and 715.4 MB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:54,429 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully