YES 2019-05-11 07:11:10,759 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:10,762 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,766 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,766 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:10,767 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:10,767 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:10,768 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:10,768 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:10,768 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:10,771 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:10,771 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:10,771 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:10,771 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:10,772 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:10,772 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,773 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:12,862 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:12,863 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:12,863 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:12,863 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:13,215 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:13,215 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:13,215 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:13,216 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:13,216 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:13,216 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:13,216 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:13,216 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:13,217 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:13,217 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:13,217 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:13,217 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:13,217 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:13,217 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:13,218 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:13,218 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:13,218 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:13,218 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:13,218 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:13,219 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:13,219 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:13,219 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:13,219 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:13,219 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:13,219 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:13,220 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:13,220 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:13,220 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:13,220 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:13,220 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:13,221 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:13,221 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:13,221 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:13,221 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:13,222 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:13,437 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:13,443 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:13,444 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:13,446 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:13,447 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:13,448 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:13,448 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:13,571 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:13,573 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:13,573 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:13,573 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:13,576 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:13,577 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,687 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:13,687 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,687 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:13,687 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:13,703 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:11:13" (1/1) ... 2019-05-11 07:11:13,709 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:11:13" (1/1) ... 2019-05-11 07:11:13,709 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:11:13" (1/1) ... 2019-05-11 07:11:13,711 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:11:13" (1/1) ... 2019-05-11 07:11:13,712 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:11:13" (1/1) ... 2019-05-11 07:11:13,713 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:11:13" (1/1) ... 2019-05-11 07:11:13,714 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,714 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:13,715 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:13,715 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:13,716 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,811 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:11:13,813 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:11:13,953 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:13,953 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:13,953 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:13,955 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:13,955 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,970 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,985 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,986 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,028 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,029 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,046 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,047 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,058 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:14,058 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:14,058 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:14,059 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:14,060 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:13" (1/5) ... 2019-05-11 07:11:14,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:11:13" (2/5) ... 2019-05-11 07:11:14,061 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (3/5) ... 2019-05-11 07:11:14,062 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:13" (4/5) ... 2019-05-11 07:11:14,062 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:14" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:14,159 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:14,159 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:14,159 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:14,159 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:14,162 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:11:14" (1/1) ... 2019-05-11 07:11:16,781 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:16,782 INFO [Benchmark.java:150]: Toolchain (without parser) took 3210.52 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 604.1 MB in the beginning and 401.3 MB in the end (delta: 202.8 MB). Peak memory consumption was 205.9 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,785 INFO [Benchmark.java:150]: CDTParser took 112.20 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 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:11:16,786 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 113.91 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:11:16,786 INFO [Benchmark.java:150]: Boogie Preprocessor took 27.07 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:11:16,787 INFO [Benchmark.java:150]: RCFGBuilder took 238.70 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 579.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,788 INFO [Benchmark.java:150]: BlockEncoding took 104.59 ms. Allocated memory is still 643.3 MB. Free memory was 579.8 MB in the beginning and 571.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,789 INFO [Benchmark.java:150]: TraceAbstraction took 100.65 ms. Allocated memory is still 643.3 MB. Free memory was 571.8 MB in the beginning and 565.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:11:16,789 INFO [Benchmark.java:150]: BuchiAutomizer took 2622.38 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 565.1 MB in the beginning and 401.3 MB in the end (delta: 163.8 MB). Peak memory consumption was 167.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,796 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:11:16,796 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:16,796 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:16,797 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 13]: Loop Invariant 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 26]: Loop Invariant 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 31]: Loop Invariant 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:16,798 INFO [BasicToolchainJob.java:95]: CFG has 19 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 19 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:11:16,799 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:16,799 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:16,799 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + 0 and consists of 7 locations. One deterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 5 locations. One deterministic module has affine ranking function xtmp + 0 and consists of 7 locations. One deterministic module has affine ranking function xtmp + 0 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. 2019-05-11 07:11:16,799 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:16,799 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 !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"448#false" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "520#unseeded" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "591#(<= main_~y~2 oldRank0)" }, initialStates = {"520#unseeded" }, finalStates = {"448#false" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("520#unseeded" "call #t~ret2 := main();" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("520#unseeded" "call ULTIMATE.init();" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("448#false" "assume true;assume !(~xtmp~2 < 0);" "448#false") ("448#false" "~y~2 := ~xtmp~2;" "448#false") ("448#false" "~x~2 := ~tmp~2;" "448#false") ("448#false" "assume ~xtmp~2 > 0;" "448#false") ("448#false" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "448#false") ("448#false" "assume true;assume !(~xtmp~2 >= ~y~2);" "448#false") ("448#false" "~y~2 := ~xtmp~2;" "448#false") ("448#false" "assume true;" "448#false") ("448#false" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "448#false") ("448#false" "assume !(~y~2 == 0);" "448#false") ("448#false" "assume !(~y~2 < 0);" "448#false") ("448#false" "assume !(~xtmp~2 > 0);" "448#false") ("448#false" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "448#false") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "~y~2 := ~xtmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume true;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "~x~2 := ~tmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 == 0);" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 < 0);" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume ~xtmp~2 > 0;" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~xtmp~2 > 0);" "448#false") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "591#(<= main_~y~2 oldRank0)") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2);" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 == 0);" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~xtmp~2 > 0;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "~y~2 := ~xtmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("591#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2);" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("591#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "591#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "520#unseeded" "return;" "520#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"162#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "132#unseeded" "149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "89#false" "141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "142#(<= main_~y~2 oldRank0)" }, initialStates = {"132#unseeded" }, finalStates = {"89#false" "141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("132#unseeded" "call #t~ret2 := main();" "135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("132#unseeded" "call ULTIMATE.init();" "135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("162#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "~y~2 := ~xtmp~2;" "141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "162#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 == 0);" "149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 < 0);" "149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume ~xtmp~2 > 0;" "149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~xtmp~2 > 0);" "89#false") ("149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "142#(<= main_~y~2 oldRank0)") ("135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("89#false" "assume true;assume !(~xtmp~2 < 0);" "89#false") ("89#false" "~y~2 := ~xtmp~2;" "89#false") ("89#false" "~x~2 := ~tmp~2;" "89#false") ("89#false" "assume ~xtmp~2 > 0;" "89#false") ("89#false" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "89#false") ("89#false" "assume true;assume !(~xtmp~2 >= ~y~2);" "89#false") ("89#false" "~y~2 := ~xtmp~2;" "89#false") ("89#false" "assume true;" "89#false") ("89#false" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "89#false") ("89#false" "assume !(~y~2 == 0);" "89#false") ("89#false" "assume !(~y~2 < 0);" "89#false") ("89#false" "assume !(~xtmp~2 > 0);" "89#false") ("89#false" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "89#false") ("141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;" "142#(<= main_~y~2 oldRank0)") ("141#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "~x~2 := ~tmp~2;" "142#(<= main_~y~2 oldRank0)") ("142#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2);" "142#(<= main_~y~2 oldRank0)") ("142#(<= main_~y~2 oldRank0)" "assume true;" "142#(<= main_~y~2 oldRank0)") ("142#(<= main_~y~2 oldRank0)" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "149#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("142#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "142#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("135#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "132#unseeded" "return;" "132#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "308#(and (<= (+ (* 2 main_~xtmp~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "284#unseeded" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"284#unseeded" }, finalStates = {"307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" }, callTransitions = { ("284#unseeded" "call #t~ret2 := main();" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("284#unseeded" "call ULTIMATE.init();" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "308#(and (<= (+ (* 2 main_~xtmp~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~y~2 := ~xtmp~2;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~y~2 == 0);" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~y~2 < 0);" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~xtmp~2 > 0;" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "307#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~tmp~2;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("287#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "284#unseeded" "return;" "284#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"448#false" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "520#unseeded" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "591#(<= main_~y~2 oldRank0)" }, initialStates = {"520#unseeded" }, finalStates = {"448#false" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("520#unseeded" "call #t~ret2 := main();" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("520#unseeded" "call ULTIMATE.init();" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("448#false" "assume true;assume !(~xtmp~2 < 0);" "448#false") ("448#false" "~y~2 := ~xtmp~2;" "448#false") ("448#false" "~x~2 := ~tmp~2;" "448#false") ("448#false" "assume ~xtmp~2 > 0;" "448#false") ("448#false" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "448#false") ("448#false" "assume true;assume !(~xtmp~2 >= ~y~2);" "448#false") ("448#false" "~y~2 := ~xtmp~2;" "448#false") ("448#false" "assume true;" "448#false") ("448#false" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "448#false") ("448#false" "assume !(~y~2 == 0);" "448#false") ("448#false" "assume !(~y~2 < 0);" "448#false") ("448#false" "assume !(~xtmp~2 > 0);" "448#false") ("448#false" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" "448#false") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "~y~2 := ~xtmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume true;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "~x~2 := ~tmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 == 0);" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~y~2 < 0);" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume ~xtmp~2 > 0;" "564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume !(~xtmp~2 > 0);" "448#false") ("564#(and (<= main_~y~2 oldRank0) (<= 1 main_~xtmp~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "591#(<= main_~y~2 oldRank0)") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2);" "540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 == 0);" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~xtmp~2 > 0;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("540#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "~y~2 := ~xtmp~2;" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("591#(<= main_~y~2 oldRank0)" "assume true;assume !(~xtmp~2 >= ~y~2);" "546#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("591#(<= main_~y~2 oldRank0)" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "591#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("523#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "520#unseeded" "return;" "520#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "886#unseeded" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "906#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, initialStates = {"886#unseeded" }, finalStates = {"906#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("886#unseeded" "call #t~ret2 := main();" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("886#unseeded" "call ULTIMATE.init();" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume true;" "912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "~x~2 := ~tmp~2;" "912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") ("912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))") ("930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "906#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "assume !(~y~2 == 0);" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))") ("930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "assume !(~y~2 < 0);" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))") ("930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "assume ~xtmp~2 > 0;" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))") ("930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "930#(and (<= main_~y~2 oldRank0) (<= 0 main_~y~2))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~xtmp~2 >= ~y~2);" "906#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 == 0);" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~y~2 < 0);" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~xtmp~2 > 0;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("906#(and (<= (+ main_~xtmp~2 1) oldRank0) (<= 0 oldRank0))" "~y~2 := ~xtmp~2;" "912#(and (<= main_~y~2 oldRank0) (<= main_~xtmp~2 oldRank0))") }, returnTransitions = { ("889#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "886#unseeded" "return;" "886#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume true;assume !(~xtmp~2 < 0);" "~y~2 := ~xtmp~2;" "~x~2 := ~tmp~2;" "assume true;" "assume true;" "assume !true;" "assume ~xtmp~2 > 0;" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "assume !true;" "assume true;assume !(~xtmp~2 >= ~y~2);" "#res := 0;assume true;" "~y~2 := ~xtmp~2;" "assume !true;" "assume true;" "assume ~y~2 < 0;~xtmp~2 := -~xtmp~2;" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "assume !(~y~2 == 0);" "assume ~y~2 == 0;~y~2 := ~y~2;" "assume !(~y~2 < 0);" "assume !(~y~2 > 0 && ~x~2 > 0);" "assume !(~xtmp~2 > 0);" "assume true;assume !!(~xtmp~2 < 0);~xtmp~2 := ~xtmp~2 - ~y~2;" }, returnAlphabet = {"return;" "return;" }, states = {"1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "1367#unseeded" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "1389#(and (<= (+ (* 2 main_~xtmp~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" }, initialStates = {"1367#unseeded" }, finalStates = {"1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" }, callTransitions = { ("1367#unseeded" "call #t~ret2 := main();" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1367#unseeded" "call ULTIMATE.init();" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "~y~2 := ~xtmp~2;" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~y~2 == 0);" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume !(~y~2 < 0);" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~xtmp~2 > 0;" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume ~xtmp~2 > 0;" "1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~y~2 > 0 && ~x~2 > 0);~tmp~2 := ~y~2;~xtmp~2 := ~x~2;" "1379#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~y~2))") ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~tmp~2;" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;havoc ~tmp~2;havoc ~xtmp~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "assume true;assume !(~xtmp~2 >= ~y~2);" "1389#(and (<= (+ (* 2 main_~xtmp~2) 1) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") ("1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))" "assume true;assume !!(~xtmp~2 >= ~y~2);~xtmp~2 := ~xtmp~2 - ~y~2;" "1388#(and (<= 0 oldRank0) (<= (+ (* 2 main_~xtmp~2) 2) (+ (* 2 main_~y~2) oldRank0)) (<= 1 main_~y~2))") }, returnTransitions = { ("1370#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1367#unseeded" "return;" "1367#unseeded") } ); 2019-05-11 07:11:16,801 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:16,802 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.5s and 7 iterations. Analysis of lassos took 1.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization removed 31 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 3/8 InterpolantCoveringCapabilityBuchi: 1/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 23 SDtfs, 21 SDslu, 30 SDs, 0 lazy, 306 Sat,233 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital18 mio100 ax100 hnf103 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 Nontermination: inital18 mio100 ax100 hnf103 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:11:16,802 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:16,802 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:16,802 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:16,802 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:16,809 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 112.20 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 113.91 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 27.07 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 238.70 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 579.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 53.1 GB * BlockEncoding took 104.59 ms. Allocated memory is still 643.3 MB. Free memory was 579.8 MB in the beginning and 571.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 100.65 ms. Allocated memory is still 643.3 MB. Free memory was 571.8 MB in the beginning and 565.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2622.38 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 565.1 MB in the beginning and 401.3 MB in the end (delta: 163.8 MB). Peak memory consumption was 167.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,834 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully