YES 2019-05-11 07:11:11,407 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:11,410 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:11,414 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:11,414 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:11,415 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:11,415 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:11,416 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:11,416 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:11,416 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:11,419 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:11,419 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:11,419 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:11,420 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:11,420 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:11,420 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:11,421 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:13,865 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:13,865 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:13,865 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:13,865 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:14,216 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:14,216 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:14,217 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:14,217 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:14,217 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:14,217 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:14,217 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:14,218 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:14,218 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:14,218 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:14,218 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:14,218 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:14,219 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:14,219 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:14,219 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:14,219 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:14,219 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:14,220 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:14,220 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:14,220 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:14,220 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:14,220 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:14,221 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:14,221 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:14,221 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:14,221 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:14,221 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:14,222 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:14,222 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:14,222 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:14,222 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:14,222 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:14,223 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:14,223 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:14,223 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:14,437 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:14,444 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:14,445 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:14,447 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:14,448 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:14,449 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:14,449 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:14,574 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:14,576 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:14,577 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:14,577 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:14,580 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:14,581 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:14" (1/1) ... 2019-05-11 07:11:14,693 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:14,693 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:14,693 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:14,693 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:14,709 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:14" (1/1) ... 2019-05-11 07:11:14,715 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:14" (1/1) ... 2019-05-11 07:11:14,715 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:14" (1/1) ... 2019-05-11 07:11:14,717 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:14" (1/1) ... 2019-05-11 07:11:14,718 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:14" (1/1) ... 2019-05-11 07:11:14,719 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:14" (1/1) ... 2019-05-11 07:11:14,720 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:14,720 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:14,721 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:14,721 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:14,722 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:14" (1/1) ... 2019-05-11 07:11:14,819 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:14,821 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:14,955 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:14,955 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:14,975 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:14,976 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:14,976 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:14" (1/1) ... 2019-05-11 07:11:14,990 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:14" (1/1) ... 2019-05-11 07:11:15,008 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:15,009 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:15,068 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:15,068 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:15,068 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:15,069 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:15,070 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:14" (1/5) ... 2019-05-11 07:11:15,071 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:14" (2/5) ... 2019-05-11 07:11:15,071 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:14" (3/5) ... 2019-05-11 07:11:15,072 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:15" (4/5) ... 2019-05-11 07:11:15,072 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:14" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:15,166 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:15,167 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:15,167 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:15,167 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:15,169 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:15" (1/1) ... 2019-05-11 07:11:17,063 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:17,064 INFO [Benchmark.java:150]: Toolchain (without parser) took 2488.46 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 607.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 53.1 GB 2019-05-11 07:11:17,066 INFO [Benchmark.java:150]: CDTParser took 114.48 ms. Allocated memory is still 649.6 MB. Free memory was 618.2 MB in the beginning and 610.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:17,067 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 116.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 604.8 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:11:17,067 INFO [Benchmark.java:150]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 603.4 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:17,068 INFO [Benchmark.java:150]: RCFGBuilder took 234.55 ms. Allocated memory is still 649.6 MB. Free memory was 603.4 MB in the beginning and 586.3 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:17,069 INFO [Benchmark.java:150]: BlockEncoding took 112.62 ms. Allocated memory is still 649.6 MB. Free memory was 586.3 MB in the beginning and 579.6 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:17,069 INFO [Benchmark.java:150]: TraceAbstraction took 98.76 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 572.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 53.1 GB 2019-05-11 07:11:17,070 INFO [Benchmark.java:150]: BuchiAutomizer took 1895.87 ms. Allocated memory is still 649.6 MB. Free memory was 572.7 MB in the beginning and 607.6 MB in the end (delta: -34.9 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:17,078 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:17,078 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:17,078 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:17,079 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:17,079 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:17,079 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:17,079 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:17,079 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:17,079 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 21]: Loop Invariant 2019-05-11 07:11:17,079 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:17,080 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:17,080 INFO [BasicToolchainJob.java:95]: CFG has 18 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 18 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:17,080 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:17,080 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:17,080 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * an + -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * an + -2 * i + 1 and consists of 5 locations. One deterministic module has 2-nested ranking function (if -2 * k + 1 > 0 then 1 else 0), (if -2 * k + 1 > 0 then -2 * k + 1 else -2 * j + 2 * bn + 1) and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:11:17,080 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:17,081 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret9 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "assume true;" "assume true;" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "assume true;" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "assume true;" "assume true;" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "assume !((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" }, returnAlphabet = {"return;" "return;" }, states = {"386#unseeded" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" }, initialStates = {"386#unseeded" }, finalStates = {"398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" }, callTransitions = { ("386#unseeded" "call #t~ret9 := main();" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("386#unseeded" "call ULTIMATE.init();" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))") ("398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") }, returnTransitions = { ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "386#unseeded" "return;" "386#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret9 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "assume true;" "assume true;" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "assume true;" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "assume true;" "assume true;" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "assume !((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" }, returnAlphabet = {"return;" "return;" }, states = {"65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "62#unseeded" "31#false" }, initialStates = {"62#unseeded" }, finalStates = {"71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "31#false" }, callTransitions = { ("62#unseeded" "call #t~ret9 := main();" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("62#unseeded" "call ULTIMATE.init();" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume !true;" "31#false") ("71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "71#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !true;" "31#false") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "#res := 0;assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "72#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("31#false" "assume true;" "31#false") ("31#false" "#res := 0;assume true;" "31#false") }, returnTransitions = { ("65#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "62#unseeded" "return;" "62#unseeded") ("31#false" "62#unseeded" "return;" "31#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret9 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "assume true;" "assume true;" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "assume true;" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "assume true;" "assume true;" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "assume !((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" }, returnAlphabet = {"return;" "return;" }, states = {"195#unseeded" "198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" }, initialStates = {"195#unseeded" }, finalStates = {"205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" }, callTransitions = { ("195#unseeded" "call #t~ret9 := main();" "198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#unseeded" "call ULTIMATE.init();" "198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume true;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "216#(and (<= main_~i~2 main_~an~2) (<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0)))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "205#(and (<= 0 oldRank0) (<= (+ (* 2 main_~an~2) 2) (+ (* 2 main_~i~2) oldRank0)))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume true;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") ("206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "206#(<= (+ (* 2 main_~an~2) 1) (+ (* 2 main_~i~2) oldRank0))") }, returnTransitions = { ("198#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "195#unseeded" "return;" "195#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret9 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "assume true;" "assume true;" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "assume true;" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "assume true;" "assume true;" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "assume !((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" }, returnAlphabet = {"return;" "return;" }, states = {"386#unseeded" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" }, initialStates = {"386#unseeded" }, finalStates = {"398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" }, callTransitions = { ("386#unseeded" "call #t~ret9 := main();" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("386#unseeded" "call ULTIMATE.init();" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(#t~nondet6 != 0);havoc #t~nondet6;~i~2 := ~i~2 + 1;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume #t~nondet6 != 0;havoc #t~nondet6;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet7;havoc #t~nondet7;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~an~2;havoc ~bn~2;havoc ~tk~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~an~2 := #t~nondet3;havoc #t~nondet3;~bn~2 := #t~nondet4;havoc #t~nondet4;~tk~2 := #t~nondet5;havoc #t~nondet5;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume true;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))") ("398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("398#(or (and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (> oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))) (<= 0 oldRank1)) (and (<= 0 oldRank0) (> oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 <= ~j~2;~i~2 := ~i~2 + 1;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 >= ~i~2 && ~bn~2 >= ~j~2;" "404#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (<= main_~j~2 main_~bn~2) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 >= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 >= ~i~2 && ~bn~2 <= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !(~an~2 <= ~i~2 && ~bn~2 >= ~j~2);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume true;" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume ~an~2 <= ~i~2 && ~bn~2 >= ~j~2;~j~2 := ~j~2 + ~k~2;~tk~2 := ~k~2;~k~2 := #t~nondet8;havoc #t~nondet8;" "422#(exists ((v_main_~j~2_42 Int) (v_main_~k~2_29 Int)) (or (and (<= v_main_~k~2_29 main_~tk~2) (<= 0 oldRank0) (<= (+ v_main_~j~2_42 v_main_~k~2_29) main_~j~2) (<= 1 (* 2 v_main_~k~2_29)) (<= v_main_~j~2_42 main_~bn~2) (<= (+ (* 2 main_~bn~2) 1) (+ (* 2 v_main_~j~2_42) oldRank1))) (and (<= 1 (+ oldRank1 (* 2 v_main_~k~2_29))) (<= v_main_~k~2_29 main_~tk~2) (<= (* 2 v_main_~k~2_29) 0) (<= 1 oldRank0))))") ("399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))" "assume !!((((~an~2 >= ~i~2 && ~bn~2 >= ~j~2) || (~an~2 >= ~i~2 && ~bn~2 <= ~j~2)) || (~an~2 <= ~i~2 && ~bn~2 >= ~j~2)) && ~k~2 >= ~tk~2 + 1);" "399#(and (>= oldRank0 (ite (<= (* 2 main_~k~2) 0) 1 0)) (>= oldRank1 (ite (<= (* 2 main_~k~2) 0) (+ (* main_~k~2 (- 2)) 1) (+ 1 (* 2 main_~bn~2) (* main_~j~2 (- 2))))))") }, returnTransitions = { ("389#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "386#unseeded" "return;" "386#unseeded") } ); 2019-05-11 07:11:17,083 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:17,084 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.8s and 5 iterations. Analysis of lassos took 0.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization removed 85 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 21 SDtfs, 21 SDslu, 34 SDs, 0 lazy, 284 Sat,135 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.4s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital22 mio100 ax100 hnf100 lsp58 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf92 smp100 dnf100 smp100 tf110 neg100 sie100 Nontermination: inital22 mio100 ax100 hnf100 lsp58 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf92 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 6 2019-05-11 07:11:17,084 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:17,084 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:17,084 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:17,084 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:17,090 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 114.48 ms. Allocated memory is still 649.6 MB. Free memory was 618.2 MB in the beginning and 610.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 116.43 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 604.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 27.02 ms. Allocated memory is still 649.6 MB. Free memory was 604.8 MB in the beginning and 603.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 234.55 ms. Allocated memory is still 649.6 MB. Free memory was 603.4 MB in the beginning and 586.3 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 53.1 GB * BlockEncoding took 112.62 ms. Allocated memory is still 649.6 MB. Free memory was 586.3 MB in the beginning and 579.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * TraceAbstraction took 98.76 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 572.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1895.87 ms. Allocated memory is still 649.6 MB. Free memory was 572.7 MB in the beginning and 607.6 MB in the end (delta: -34.9 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:17,117 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully