YES 2019-05-11 07:09:03,285 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:03,288 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:03,292 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:03,292 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:03,293 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:03,293 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:03,293 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:03,294 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:03,294 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:03,296 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:03,297 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:03,297 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:03,297 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:03,298 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:03,298 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:03,299 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:06,967 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:06,967 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:06,968 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:06,968 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:07,381 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:07,381 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:07,382 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:07,382 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:07,382 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:07,382 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:07,382 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:07,383 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:07,383 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:07,383 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:07,383 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:07,384 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:07,384 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:07,384 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:07,384 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:07,384 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:07,385 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:07,385 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:07,385 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:07,385 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:07,385 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:07,386 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:07,386 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:07,386 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:07,386 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:07,386 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:07,387 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:07,387 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:07,387 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:07,387 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:07,387 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:07,388 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:07,388 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:07,388 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:07,389 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:07,608 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:07,615 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:07,616 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:07,618 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:07,620 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:07,620 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:07,620 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:07,746 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:07,748 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:07,748 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:07,748 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:07,752 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:07,753 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:07" (1/1) ... 2019-05-11 07:09:07,861 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:07,862 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:07,862 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:07,862 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:07,878 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:07" (1/1) ... 2019-05-11 07:09:07,882 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:07" (1/1) ... 2019-05-11 07:09:07,882 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:07" (1/1) ... 2019-05-11 07:09:07,884 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:07" (1/1) ... 2019-05-11 07:09:07,885 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:07" (1/1) ... 2019-05-11 07:09:07,886 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:07" (1/1) ... 2019-05-11 07:09:07,887 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:07,888 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:07,888 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:07,888 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:07,890 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:07" (1/1) ... 2019-05-11 07:09:07,992 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:07,995 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:08,115 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:08,115 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:08,115 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:08,117 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:08,117 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:08" (1/1) ... 2019-05-11 07:09:08,132 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:08" (1/1) ... 2019-05-11 07:09:08,177 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:08,178 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:08,183 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:08,184 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:08,184 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:08,185 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:08,185 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:08,186 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:08,187 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:08" (1/5) ... 2019-05-11 07:09:08,188 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:07" (2/5) ... 2019-05-11 07:09:08,188 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:08" (3/5) ... 2019-05-11 07:09:08,188 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:08" (4/5) ... 2019-05-11 07:09:08,189 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:07" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:08,286 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:08,287 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:08,287 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:08,287 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:08,289 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:08" (1/1) ... 2019-05-11 07:09:10,200 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:10,201 INFO [Benchmark.java:150]: Toolchain (without parser) took 2454.25 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 606.7 MB in the beginning and 574.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:10,203 INFO [Benchmark.java:150]: CDTParser took 114.71 ms. Allocated memory is still 643.3 MB. Free memory was 614.8 MB in the beginning and 608.1 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:10,204 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.73 ms. Allocated memory is still 643.3 MB. Free memory was 606.7 MB in the beginning and 600.1 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:10,205 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.58 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 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:10,206 INFO [Benchmark.java:150]: RCFGBuilder took 227.42 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 581.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 53.1 GB 2019-05-11 07:09:10,207 INFO [Benchmark.java:150]: BlockEncoding took 69.35 ms. Allocated memory is still 643.3 MB. Free memory was 581.8 MB in the beginning and 576.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:10,207 INFO [Benchmark.java:150]: TraceAbstraction took 101.55 ms. Allocated memory is still 643.3 MB. Free memory was 576.5 MB in the beginning and 571.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB 2019-05-11 07:09:10,208 INFO [Benchmark.java:150]: BuchiAutomizer took 1913.46 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 571.1 MB in the beginning and 574.5 MB in the end (delta: -3.5 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:10,214 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:10,215 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:10,215 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:10,215 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:10,215 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:10,215 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:10,215 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 22]: Loop Invariant 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:10,216 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 6 locations. One deterministic module has affine ranking function x + -1 * y + 0 and consists of 4 locations. One nondeterministic module has affine ranking function x + -1 * y + 0 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:10,217 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 >= 0);" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "163#(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 = {"162#(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 = { ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "assume true;" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "163#(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)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~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;" "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;assume !(~y~2 < ~x~2);" "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)|))))" "~x~2 := ~x~2 - 1;" "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;assume ~y~2 < ~x~2;" "162#(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 finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 >= 0);" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "163#(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 = {"162#(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 = { ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "assume true;" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "163#(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)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~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;" "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;assume !(~y~2 < ~x~2);" "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)|))))" "~x~2 := ~x~2 - 1;" "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;assume ~y~2 < ~x~2;" "162#(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 buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 >= 0);" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "56#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "27#false" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "46#unseeded" }, initialStates = {"46#unseeded" }, finalStates = {"55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "27#false" }, callTransitions = { ("46#unseeded" "call #t~ret2 := main();" "49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("46#unseeded" "call ULTIMATE.init();" "49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !(~x~2 >= 0);" "56#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume !true;" "27#false") ("55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("56#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "assume true;" "56#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("56#(<= (+ (* 2 main_~x~2) 1) oldRank0)" "#res := 0;assume true;" "56#(<= (+ (* 2 main_~x~2) 1) oldRank0)") ("27#false" "assume true;assume !(~y~2 < ~x~2);" "27#false") ("27#false" "assume true;" "27#false") ("27#false" "assume !true;" "27#false") ("27#false" "assume true;" "27#false") ("27#false" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "27#false") ("27#false" "~x~2 := ~x~2 - 1;" "27#false") ("27#false" "assume true;assume !(~x~2 >= 0);" "27#false") ("27#false" "assume true;" "27#false") ("27#false" "assume !true;" "27#false") ("27#false" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("27#false" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "27#false") ("60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !(~y~2 < ~x~2);" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume !true;" "27#false") ("60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "55#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "60#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("46#unseeded" "assume true;" "46#unseeded") }, returnTransitions = { ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "46#unseeded" "return;" "46#unseeded") ("49#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "46#unseeded" "return;" "46#unseeded") ("27#false" "46#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 >= 0);" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "163#(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 = {"162#(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 = { ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "162#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "assume true;" "163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("163#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "163#(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)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~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;" "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;assume !(~y~2 < ~x~2);" "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)|))))" "~x~2 := ~x~2 - 1;" "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;assume ~y~2 < ~x~2;" "162#(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 buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume !(~y~2 < ~x~2);" "~x~2 := ~x~2 - 1;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "assume true;" "assume !true;" "assume true;" "assume true;assume !(~x~2 >= 0);" "assume true;" "assume !true;" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume !(~x~2 >= 0);" "#res := 0;assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "559#unseeded" }, initialStates = {"559#unseeded" }, finalStates = {"570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("559#unseeded" "call #t~ret2 := main();" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("559#unseeded" "call ULTIMATE.init();" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~x~2 := ~n~2;assume ~x~2 >= 0;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~x~2);" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;assume ~y~2 < ~x~2;" "570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "570#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "assume true;" "571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "571#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") }, returnTransitions = { ("562#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "559#unseeded" "return;" "559#unseeded") } ); 2019-05-11 07:09:10,218 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:10,219 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.8s and 6 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization removed 11 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 2/3 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 21 SDtfs, 2 SDslu, 24 SDs, 0 lazy, 135 Sat,116 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital14 mio100 ax100 hnf114 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 Nontermination: inital14 mio100 ax100 hnf114 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 82ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:09:10,219 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:10,219 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:10,220 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:10,220 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:10,226 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 114.71 ms. Allocated memory is still 643.3 MB. Free memory was 614.8 MB in the beginning and 608.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.73 ms. Allocated memory is still 643.3 MB. Free memory was 606.7 MB in the beginning and 600.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.58 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 227.42 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 581.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 53.1 GB * BlockEncoding took 69.35 ms. Allocated memory is still 643.3 MB. Free memory was 581.8 MB in the beginning and 576.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * TraceAbstraction took 101.55 ms. Allocated memory is still 643.3 MB. Free memory was 576.5 MB in the beginning and 571.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1913.46 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 571.1 MB in the beginning and 574.5 MB in the end (delta: -3.5 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:09:10,252 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully