YES 2019-05-11 07:11:23,967 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:23,970 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:23,973 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:23,974 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:23,975 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:23,975 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:23,975 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:23,975 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:23,976 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:23,978 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:23,979 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:23,979 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:23,979 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:23,979 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:23,980 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:23,981 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:25,399 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:25,400 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:25,400 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:25,400 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:25,821 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:25,822 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:25,822 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:25,822 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:25,822 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:25,822 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:25,823 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:25,823 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:25,823 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:25,823 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:25,823 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:25,824 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:25,824 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:25,824 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:25,824 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:25,824 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:25,825 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:25,825 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:25,825 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:25,825 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:25,825 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:25,825 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:25,826 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:25,826 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:25,826 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:25,826 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:25,826 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:25,827 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:25,827 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:25,827 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:25,827 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:25,827 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:25,828 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:25,828 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:25,828 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:26,045 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:26,051 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:26,051 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:26,054 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:26,055 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:26,055 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:26,056 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:26,179 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:26,181 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:26,181 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:26,181 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:26,185 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:26,186 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:26" (1/1) ... 2019-05-11 07:11:26,295 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:26,296 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:26,296 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:26,296 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:26,312 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:26" (1/1) ... 2019-05-11 07:11:26,317 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:26" (1/1) ... 2019-05-11 07:11:26,318 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:26" (1/1) ... 2019-05-11 07:11:26,319 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:26" (1/1) ... 2019-05-11 07:11:26,321 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:26" (1/1) ... 2019-05-11 07:11:26,321 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:26" (1/1) ... 2019-05-11 07:11:26,323 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:26,323 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:26,323 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:26,323 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:26,325 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:26" (1/1) ... 2019-05-11 07:11:26,421 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:26,423 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:26,559 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:26,576 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:26,577 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:26,578 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:26,578 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:26" (1/1) ... 2019-05-11 07:11:26,594 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:26" (1/1) ... 2019-05-11 07:11:26,661 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,662 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,663 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,664 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,665 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,666 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:26,666 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:26,667 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:26,667 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:26,668 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:26,668 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:26" (1/5) ... 2019-05-11 07:11:26,669 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:26" (2/5) ... 2019-05-11 07:11:26,670 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:26" (3/5) ... 2019-05-11 07:11:26,670 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:26" (4/5) ... 2019-05-11 07:11:26,671 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:26" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:26,758 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:26,759 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:26,759 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:26,759 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:26,762 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:26" (1/1) ... 2019-05-11 07:11:29,505 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:29,506 INFO [Benchmark.java:150]: Toolchain (without parser) took 3326.16 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 395.3 MB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,508 INFO [Benchmark.java:150]: CDTParser took 112.68 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.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:29,509 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 114.65 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,510 INFO [Benchmark.java:150]: Boogie Preprocessor took 26.63 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,511 INFO [Benchmark.java:150]: RCFGBuilder took 253.20 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 586.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,512 INFO [Benchmark.java:150]: BlockEncoding took 90.18 ms. Allocated memory is still 649.6 MB. Free memory was 586.4 MB in the beginning and 579.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,512 INFO [Benchmark.java:150]: TraceAbstraction took 91.94 ms. Allocated memory is still 649.6 MB. Free memory was 579.7 MB in the beginning and 572.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,513 INFO [Benchmark.java:150]: BuchiAutomizer took 2746.20 ms. Allocated memory is still 649.6 MB. Free memory was 572.9 MB in the beginning and 395.3 MB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,519 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:29,520 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:29,520 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:29,520 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:29,520 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:29,521 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:29,521 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:29,521 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:29,521 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 23]: Loop Invariant 2019-05-11 07:11:29,521 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:29,522 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 28]: Loop Invariant 2019-05-11 07:11:29,522 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:29,522 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 25]: Loop Invariant 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:95]: CFG has 15 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 15 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:29,523 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 10 terminating modules (3 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + n + 0 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * k + 0 and consists of 4 locations. One deterministic module has affine ranking function m + -1 * j + 0 and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i + 0 and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N + 0 and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i + 0 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * j + m + 0 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:11:29,523 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:29,524 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "511#unseeded" }, initialStates = {"511#unseeded" }, finalStates = {"524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("511#unseeded" "call #t~ret6 := main();" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("511#unseeded" "call ULTIMATE.init();" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "~i~2 := ~i~2 + 1;" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;assume !(~k~2 < ~N~2);" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "~i~2 := ~i~2 + 1;" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))") }, returnTransitions = { ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "511#unseeded" "return;" "511#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration6 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "910#unseeded" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))" }, initialStates = {"910#unseeded" }, finalStates = {"925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" }, callTransitions = { ("910#unseeded" "call #t~ret6 := main();" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("910#unseeded" "call ULTIMATE.init();" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~k~2;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~i~2 + 1;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") }, returnTransitions = { ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "910#unseeded" "return;" "910#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "85#unseeded" "88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "94#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, initialStates = {"85#unseeded" }, finalStates = {"94#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("85#unseeded" "call #t~ret6 := main();" "88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("85#unseeded" "call ULTIMATE.init();" "88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !(~k~2 < ~N~2);" "98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !(~j~2 < ~m~2);" "98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "~i~2 := ~i~2 + 1;" "94#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "94#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("94#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "98#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") }, returnTransitions = { ("88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "85#unseeded" "return;" "85#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"192#(<= main_~N~2 (+ main_~k~2 oldRank0))" "178#unseeded" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" }, initialStates = {"178#unseeded" }, finalStates = {"191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" }, callTransitions = { ("178#unseeded" "call #t~ret6 := main();" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("178#unseeded" "call ULTIMATE.init();" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("192#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~k~2;" "192#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("192#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "192#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("192#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~i~2 + 1;" "192#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("192#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "192#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("191#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "192#(<= main_~N~2 (+ main_~k~2 oldRank0))") }, returnTransitions = { ("181#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "178#unseeded" "return;" "178#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"298#unseeded" "314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"298#unseeded" }, finalStates = {"314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" }, callTransitions = { ("298#unseeded" "call #t~ret6 := main();" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("298#unseeded" "call ULTIMATE.init();" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "~i~2 := ~k~2;" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !(~k~2 < ~N~2);" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "~i~2 := ~k~2;" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "~i~2 := ~i~2 + 1;" "315#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("315#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "314#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("301#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "298#unseeded" "return;" "298#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "511#unseeded" }, initialStates = {"511#unseeded" }, finalStates = {"524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("511#unseeded" "call #t~ret6 := main();" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("511#unseeded" "call ULTIMATE.init();" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "~i~2 := ~i~2 + 1;" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))") ("524#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;assume !(~k~2 < ~N~2);" "525#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("525#(<= main_~n~2 (+ main_~i~2 oldRank0))" "~i~2 := ~i~2 + 1;" "532#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))") }, returnTransitions = { ("514#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "511#unseeded" "return;" "511#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "910#unseeded" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))" }, initialStates = {"910#unseeded" }, finalStates = {"925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" }, callTransitions = { ("910#unseeded" "call #t~ret6 := main();" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("910#unseeded" "call ULTIMATE.init();" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))") ("925#(and (<= 0 oldRank0) (<= (+ main_~N~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~k~2;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "~i~2 := ~i~2 + 1;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") ("926#(<= main_~N~2 (+ main_~k~2 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "926#(<= main_~N~2 (+ main_~k~2 oldRank0))") }, returnTransitions = { ("913#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "910#unseeded" "return;" "910#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration7 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"1552#unseeded" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1573#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "1581#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0))" "1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" }, initialStates = {"1552#unseeded" }, finalStates = {"1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("1552#unseeded" "call #t~ret6 := main();" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1552#unseeded" "call ULTIMATE.init();" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1573#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "1581#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0))") ("1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "~i~2 := ~k~2;" "1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "~i~2 := ~i~2 + 1;" "1573#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)))") ("1581#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("1581#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "1591#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "~i~2 := ~k~2;" "1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") ("1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !(~j~2 < ~m~2);" "1565#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "1615#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= 2 oldRank0) (<= (+ main_~n~2 1) (+ main_~k~2 oldRank0)))") }, returnTransitions = { ("1555#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1552#unseeded" "return;" "1552#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration8 = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume !((0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2);" "assume !true;" "#res := 0;assume true;" "assume !true;" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "assume true;assume !(~k~2 < ~N~2);" "~i~2 := ~k~2;" "assume true;assume !(~j~2 < ~m~2);" "assume true;" "~i~2 := ~i~2 + 1;" "assume true;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" }, returnAlphabet = {"return;" "return;" }, states = {"2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "2037#unseeded" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" }, initialStates = {"2037#unseeded" }, finalStates = {"2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" }, callTransitions = { ("2037#unseeded" "call #t~ret6 := main();" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2037#unseeded" "call ULTIMATE.init();" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !(~k~2 < ~N~2);" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "~i~2 := ~k~2;" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !(~j~2 < ~m~2);" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "~i~2 := ~i~2 + 1;" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2048#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~k~2 < ~N~2);" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~k~2;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~k~2;havoc ~m~2;havoc ~n~2;havoc ~N~2;~i~2 := #t~nondet0;havoc #t~nondet0;~j~2 := #t~nondet1;havoc #t~nondet1;~k~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;~m~2 := #t~nondet4;havoc #t~nondet4;~N~2 := #t~nondet5;havoc #t~nondet5;assume (0 <= ~n~2 && 0 <= ~m~2) && 0 <= ~N~2;~i~2 := 0;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 < ~m~2);" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !!(~k~2 < ~N~2);~k~2 := ~k~2 + 1;" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !(~k~2 < ~N~2);" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !(~j~2 < ~m~2);" "2048#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;assume !!(~j~2 < ~m~2);~j~2 := ~j~2 + 1;~k~2 := ~i~2;" "2047#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") }, returnTransitions = { ("2040#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2037#unseeded" "return;" "2037#unseeded") } ); 2019-05-11 07:11:29,526 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:29,527 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.7s and 9 iterations. Analysis of lassos took 0.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization removed 186 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 58 states and ocurred in iteration 5. Nontrivial modules had stage [5, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 4/6 InterpolantCoveringCapabilityBuchi: 0/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 39 SDtfs, 15 SDslu, 27 SDs, 0 lazy, 349 Sat,299 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.3s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital17 mio100 ax100 hnf107 lsp73 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital17 mio100 ax100 hnf107 lsp73 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:29,527 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:29,528 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:29,528 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:29,528 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:29,534 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 112.68 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 114.65 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 26.63 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 253.20 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 586.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 53.1 GB * BlockEncoding took 90.18 ms. Allocated memory is still 649.6 MB. Free memory was 586.4 MB in the beginning and 579.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * TraceAbstraction took 91.94 ms. Allocated memory is still 649.6 MB. Free memory was 579.7 MB in the beginning and 572.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2746.20 ms. Allocated memory is still 649.6 MB. Free memory was 572.9 MB in the beginning and 395.3 MB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 53.1 GB 2019-05-11 07:11:29,559 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully