YES

2019-05-11 07:09:55,042 INFO  [UltimateCore.java:185]: Initializing application
2019-05-11 07:09:55,046 INFO  [UltimateCore.java:202]: --------------------------------------------------------------------------------
2019-05-11 07:09:55,049 INFO  [PluginFactory.java:62]: --------------------------------------------------------------------------------
2019-05-11 07:09:55,049 INFO  [PluginFactory.java:63]: Detecting plugins...
2019-05-11 07:09:55,050 INFO  [PluginFactory.java:287]: 1 IController plugins available
2019-05-11 07:09:55,051 INFO  [PluginFactory.java:287]: 4 ISource plugins available
2019-05-11 07:09:55,051 INFO  [PluginFactory.java:287]: 1 IOutput plugins available
2019-05-11 07:09:55,051 INFO  [PluginFactory.java:287]: 10 IGenerator plugins available
2019-05-11 07:09:55,052 INFO  [PluginFactory.java:287]: 5 IAnalysis plugins available
2019-05-11 07:09:55,054 INFO  [PluginFactory.java:241]: Loaded  controller UltimateCore
2019-05-11 07:09:55,054 INFO  [PluginFactory.java:70]: Finished detecting plugins!
2019-05-11 07:09:55,055 INFO  [PluginFactory.java:71]: Loading services ...
2019-05-11 07:09:55,055 INFO  [PluginFactory.java:272]: 0 IServiceFactory services available
2019-05-11 07:09:55,055 INFO  [PluginFactory.java:73]: Finished loading services!
2019-05-11 07:09:55,055 INFO  [PluginFactory.java:74]: --------------------------------------------------------------------------------
2019-05-11 07:09:55,057 INFO  [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf
2019-05-11 07:09:56,885 INFO  [SettingsManager.java:54]: Loading preferences was successful
2019-05-11 07:09:56,885 INFO  [SettingsManager.java:55]: Preferences different from defaults:
2019-05-11 07:09:56,886 INFO  [PluginFactory.java:178]: --------------------------------------------------------------------------------
2019-05-11 07:09:56,886 INFO  [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences)
2019-05-11 07:09:57,244 INFO  [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible)
2019-05-11 07:09:57,244 INFO  [PluginFactory.java:198]: --------------------------------------------------------------------------------
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults:
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:63]:  * Only non-decreasing invariants=true
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:63]:  * Termination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:63]:  * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:63]:  * Nontermination analysis=LINEAR_WITH_GUESSES
2019-05-11 07:09:57,245 INFO  [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults:
2019-05-11 07:09:57,246 INFO  [SettingsManager.java:63]:  * Rating-Boundary (empty for LBE)=0
2019-05-11 07:09:57,246 INFO  [SettingsManager.java:63]:  * Strategy for the edge rating=DISJUNCTIVE_RATING
2019-05-11 07:09:57,246 INFO  [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults:
2019-05-11 07:09:57,246 INFO  [SettingsManager.java:63]:  * Lasso Analysis=Linear_with_guesses
2019-05-11 07:09:57,246 INFO  [SettingsManager.java:63]:  * Use external solver (rank synthesis)=false
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:63]:  * Buchi interpolant automaton=StagedBlast
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:63]:  * Construct termination proof for TermComp=true
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults:
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:63]:  * Check unreachability of error function in SV-COMP mode=false
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:63]:  * Size of pointer (in bytes)=8
2019-05-11 07:09:57,247 INFO  [SettingsManager.java:63]:  * Check if freed pointer was valid=false
2019-05-11 07:09:57,248 INFO  [SettingsManager.java:63]:  * How to treat unsigned ints differently from normal ones=IGNORE
2019-05-11 07:09:57,248 INFO  [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults:
2019-05-11 07:09:57,248 INFO  [SettingsManager.java:63]:  * Timeout in seconds=100000
2019-05-11 07:09:57,248 INFO  [SettingsManager.java:63]:  * The redirection strategy for Impulse=RANDOmSTRONGEST
2019-05-11 07:09:57,248 INFO  [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults:
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:63]:  * Size of a code block=SequenceOfStatements
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:63]:  * Convert code blocks to CNF=false
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:63]:  * To the following directory=/home/matthias/ultimate/dump
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:63]:  * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults:
2019-05-11 07:09:57,249 INFO  [SettingsManager.java:63]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
2019-05-11 07:09:57,250 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:57,250 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:57,250 INFO  [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults:
2019-05-11 07:09:57,250 INFO  [SettingsManager.java:63]:  * Log level for plugins=warn
2019-05-11 07:09:57,251 INFO  [UltimateCore.java:76]: Initializing controller ...
2019-05-11 07:09:57,469 INFO  [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp
2019-05-11 07:09:57,475 INFO  [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:57,476 INFO  [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated...
2019-05-11 07:09:57,478 INFO  [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected.
2019-05-11 07:09:57,479 INFO  [PluginConnector.java:252]: Initializing CDTParser...
2019-05-11 07:09:57,480 INFO  [PluginConnector.java:257]: CDTParser initialized
2019-05-11 07:09:57,480 INFO  [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c
2019-05-11 07:09:57,602 INFO  [ToolchainManager.java:238]: ####################### [Toolchain 1] #######################
2019-05-11 07:09:57,604 INFO  [ToolchainWalker.java:61]: Walking toolchain with 6 elements.
2019-05-11 07:09:57,604 INFO  [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:57,604 INFO  [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator...
2019-05-11 07:09:57,608 INFO  [PluginConnector.java:257]: CACSL2BoogieTranslator initialized
2019-05-11 07:09:57,608 INFO  [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,717 INFO  [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator----------------------------
2019-05-11 07:09:57,718 INFO  [PluginConnector.java:90]: ------------------------Boogie Preprocessor----------------------------
2019-05-11 07:09:57,718 INFO  [PluginConnector.java:252]: Initializing Boogie Preprocessor...
2019-05-11 07:09:57,718 INFO  [PluginConnector.java:257]: Boogie Preprocessor initialized
2019-05-11 07:09:57,734 INFO  [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,739 INFO  [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,740 INFO  [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,741 INFO  [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,743 INFO  [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,743 INFO  [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,744 INFO  [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor----------------------------
2019-05-11 07:09:57,745 INFO  [PluginConnector.java:90]: ------------------------RCFGBuilder----------------------------
2019-05-11 07:09:57,745 INFO  [PluginConnector.java:252]: Initializing RCFGBuilder...
2019-05-11 07:09:57,745 INFO  [PluginConnector.java:257]: RCFGBuilder initialized
2019-05-11 07:09:57,747 INFO  [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,842 INFO  [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
2019-05-11 07:09:57,844 INFO  [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000
2019-05-11 07:09:57,972 INFO  [PluginConnector.java:110]: ------------------------ END RCFGBuilder----------------------------
2019-05-11 07:09:57,973 INFO  [PluginConnector.java:90]: ------------------------BlockEncoding----------------------------
2019-05-11 07:09:57,973 INFO  [PluginConnector.java:252]: Initializing BlockEncoding...
2019-05-11 07:09:57,974 INFO  [PluginConnector.java:257]: BlockEncoding initialized
2019-05-11 07:09:57,975 INFO  [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:57,989 INFO  [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:57" (1/1) ...
2019-05-11 07:09:58,047 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,048 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,049 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,050 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,051 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,052 WARN  [TransFormula.java:607]: CodeBlock already infeasible
2019-05-11 07:09:58,053 INFO  [PluginConnector.java:110]: ------------------------ END BlockEncoding----------------------------
2019-05-11 07:09:58,054 INFO  [PluginConnector.java:90]: ------------------------TraceAbstraction----------------------------
2019-05-11 07:09:58,054 INFO  [PluginConnector.java:252]: Initializing TraceAbstraction...
2019-05-11 07:09:58,055 INFO  [PluginConnector.java:257]: TraceAbstraction initialized
2019-05-11 07:09:58,055 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:58" (1/5) ...
2019-05-11 07:09:58,057 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:57" (2/5) ...
2019-05-11 07:09:58,057 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:57" (3/5) ...
2019-05-11 07:09:58,057 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:57" (4/5) ...
2019-05-11 07:09:58,058 INFO  [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:57" (5/5) ...
Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
2019-05-11 07:09:58,152 INFO  [PluginConnector.java:110]: ------------------------ END TraceAbstraction----------------------------
2019-05-11 07:09:58,153 INFO  [PluginConnector.java:90]: ------------------------BuchiAutomizer----------------------------
2019-05-11 07:09:58,153 INFO  [PluginConnector.java:252]: Initializing BuchiAutomizer...
2019-05-11 07:09:58,153 INFO  [PluginConnector.java:257]: BuchiAutomizer initialized
2019-05-11 07:09:58,155 INFO  [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:58" (1/1) ...
2019-05-11 07:10:01,922 INFO  [PluginConnector.java:110]: ------------------------ END BuchiAutomizer----------------------------
2019-05-11 07:10:01,923 INFO  [Benchmark.java:150]: Toolchain (without parser) took 4320.16 ms. Allocated memory was 514.9 MB in the beginning and 568.3 MB in the end (delta: 53.5 MB). Free memory was 483.4 MB in the beginning and 389.9 MB in the end (delta: 93.5 MB). Peak memory consumption was 147.0 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,938 INFO  [Benchmark.java:150]: CDTParser took 111.18 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,939 INFO  [Benchmark.java:150]: CACSL2BoogieTranslator took 113.55 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,940 INFO  [Benchmark.java:150]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.3 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:10:01,941 INFO  [Benchmark.java:150]: RCFGBuilder took 227.80 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.0 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,942 INFO  [Benchmark.java:150]: BlockEncoding took 80.69 ms. Allocated memory is still 514.9 MB. Free memory was 464.0 MB in the beginning and 457.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,942 INFO  [Benchmark.java:150]: TraceAbstraction took 98.90 ms. Allocated memory is still 514.9 MB. Free memory was 457.9 MB in the beginning and 451.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,943 INFO  [Benchmark.java:150]: BuchiAutomizer took 3769.23 ms. Allocated memory was 514.9 MB in the beginning and 568.3 MB in the end (delta: 53.5 MB). Free memory was 451.1 MB in the beginning and 389.9 MB in the end (delta: 61.2 MB). Peak memory consumption was 114.7 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,950 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:10:01,950 INFO  [ToolchainManager.java:286]: #######################  End [Toolchain 1] #######################
2019-05-11 07:10:01,950 INFO  [BasicToolchainJob.java:73]:  --- Results ---
2019-05-11 07:10:01,950 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:89]:   - AllSpecificationsHoldResult: All specifications hold
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:95]:     We were not able to verify any specifiation because the program does not contain any specification.
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:89]:   - ProcedureContractResult [Line: 13]: Procedure Contract for main
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:95]:     Derived contract for procedure main: 1
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 22]: Loop Invariant
2019-05-11 07:10:01,951 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 20]: Loop Invariant
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:89]:   - InvariantResult [Line: 17]: Loop Invariant
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:95]:     Derived loop invariant: 1
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Ultimate Automizer benchmark data
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:95]:     CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0.	InterpolantCoveringCapability: 0/0	ICC %: NaN	EdgeCheckerBenchmarkData: No data available	TraceCheckerBenchmark: No data available	InterpolantConsolidationBenchmark: No data available	
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:75]:  * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
2019-05-11 07:10:01,952 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed decomposition of program
2019-05-11 07:10:01,953 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into 8 terminating modules (1 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function x + 0 and consists of 4 locations. One deterministic module has affine ranking function -1 * x + y + 0 and consists of 5 locations. One deterministic module has affine ranking function x + 0 and consists of 5 locations. One deterministic module has affine ranking function y + 0 and consists of 8 locations. One deterministic module has affine ranking function x + 0 and consists of 5 locations. One nondeterministic module has affine ranking function y + -1 * x + 0 and consists of 5 locations. One nondeterministic module has affine ranking function x + 0 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations.
2019-05-11 07:10:01,953 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Constructed termination proof in form of nested word automata
2019-05-11 07:10:01,953 INFO  [BasicToolchainJob.java:95]:     Your program was decomposed into the following automata 

NestedWordAutomaton buchiAutomatonIteration2 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"85#unseeded" "88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "95#(<= main_~x~2 oldRank0)" },
	initialStates = {"85#unseeded" },
	finalStates = {"94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" },
	callTransitions = {
		 ("85#unseeded" "call #t~ret4 := 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 = {
		 ("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)|))))")
		 ("88#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "95#(<= main_~x~2 oldRank0)")
		 ("94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "95#(<= main_~x~2 oldRank0)")
		 ("94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("95#(<= main_~x~2 oldRank0)" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "95#(<= main_~x~2 oldRank0)")
		 ("95#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "95#(<= main_~x~2 oldRank0)")
		 ("95#(<= main_~x~2 oldRank0)" "~y~2 := ~y~2 - 1;" "95#(<= main_~x~2 oldRank0)")
		 ("95#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "95#(<= main_~x~2 oldRank0)")
		 ("95#(<= main_~x~2 oldRank0)" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "95#(<= main_~x~2 oldRank0)")
		 ("95#(<= main_~x~2 oldRank0)" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "94#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
	},
	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~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "198#(<= main_~y~2 (+ main_~x~2 oldRank0))" "214#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "186#unseeded" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"186#unseeded" },
	finalStates = {"197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" },
	callTransitions = {
		 ("186#unseeded" "call #t~ret4 := main();" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("186#unseeded" "call ULTIMATE.init();" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "198#(<= main_~y~2 (+ main_~x~2 oldRank0))")
		 ("198#(<= main_~y~2 (+ main_~x~2 oldRank0))" "~y~2 := ~y~2 - 1;" "214#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("214#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("214#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "214#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "197#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("189#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "186#unseeded" "return;" "186#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration4 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"369#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "361#(<= main_~x~2 oldRank0)" "347#unseeded" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" },
	initialStates = {"347#unseeded" },
	finalStates = {"360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" },
	callTransitions = {
		 ("347#unseeded" "call #t~ret4 := main();" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("347#unseeded" "call ULTIMATE.init();" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("369#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "361#(<= main_~x~2 oldRank0)")
		 ("360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "361#(<= main_~x~2 oldRank0)")
		 ("360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "369#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))")
		 ("361#(<= main_~x~2 oldRank0)" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "361#(<= main_~x~2 oldRank0)")
		 ("361#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "361#(<= main_~x~2 oldRank0)")
		 ("361#(<= main_~x~2 oldRank0)" "~y~2 := ~y~2 - 1;" "361#(<= main_~x~2 oldRank0)")
		 ("361#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "361#(<= main_~x~2 oldRank0)")
		 ("361#(<= main_~x~2 oldRank0)" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "369#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "360#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	returnTransitions = {
		 ("350#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "347#unseeded" "return;" "347#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration5 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"946#unseeded" "978#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "958#(<= main_~y~2 (+ main_~x~2 oldRank0))" },
	initialStates = {"946#unseeded" },
	finalStates = {"957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" },
	callTransitions = {
		 ("946#unseeded" "call #t~ret4 := main();" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("946#unseeded" "call ULTIMATE.init();" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("978#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("978#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "978#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
		 ("957#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "958#(<= main_~y~2 (+ main_~x~2 oldRank0))")
		 ("958#(<= main_~y~2 (+ main_~x~2 oldRank0))" "~y~2 := ~y~2 - 1;" "978#(and (<= main_~y~2 (+ main_~x~2 oldRank0)) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))")
	},
	returnTransitions = {
		 ("949#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "946#unseeded" "return;" "946#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration6 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"1200#unseeded" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))" "1334#(and (<= (+ main_~x~2 main_~y~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "1215#(<= main_~y~2 oldRank0)" "1279#(<= (+ main_~x~2 main_~y~2 1) oldRank0)" },
	initialStates = {"1200#unseeded" },
	finalStates = {"1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" },
	callTransitions = {
		 ("1200#unseeded" "call #t~ret4 := main();" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1200#unseeded" "call ULTIMATE.init();" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))")
		 ("1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "1334#(and (<= (+ main_~x~2 main_~y~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1334#(and (<= (+ main_~x~2 main_~y~2 1) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "~y~2 := ~y~2 - 1;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "1279#(<= (+ main_~x~2 main_~y~2 1) oldRank0)")
		 ("1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1214#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "1215#(<= main_~y~2 oldRank0)")
		 ("1215#(<= main_~y~2 oldRank0)" "~y~2 := ~y~2 - 1;" "1223#(and (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0))")
		 ("1279#(<= (+ main_~x~2 main_~y~2 1) oldRank0)" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "1300#(and (<= (+ main_~y~2 2) oldRank0) (<= main_~y~2 oldRank0) (<= (+ main_~y~2 1) oldRank0) (<= (+ main_~y~2 3) (+ main_~x~2 oldRank0)))")
	},
	returnTransitions = {
		 ("1203#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1200#unseeded" "return;" "1200#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration7 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "1558#(<= main_~x~2 oldRank0)" "1534#unseeded" "1599#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" },
	initialStates = {"1534#unseeded" },
	finalStates = {"1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" },
	callTransitions = {
		 ("1534#unseeded" "call #t~ret4 := main();" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1534#unseeded" "call ULTIMATE.init();" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1558#(<= main_~x~2 oldRank0)")
		 ("1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1558#(<= main_~x~2 oldRank0)")
		 ("1558#(<= main_~x~2 oldRank0)" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "1558#(<= main_~x~2 oldRank0)")
		 ("1558#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "1558#(<= main_~x~2 oldRank0)")
		 ("1558#(<= main_~x~2 oldRank0)" "~y~2 := ~y~2 - 1;" "1558#(<= main_~x~2 oldRank0)")
		 ("1558#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "1558#(<= main_~x~2 oldRank0)")
		 ("1558#(<= main_~x~2 oldRank0)" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "1599#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))")
		 ("1599#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "1557#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("1537#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1534#unseeded" "return;" "1534#unseeded")
	}
);

NestedWordAutomaton buchiAutomatonIteration8 = (
	callAlphabet = {"call #t~ret4 := main();" "call ULTIMATE.init();" },
	internalAlphabet = {"assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "~y~2 := ~y~2 - 1;" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "assume true;assume !(~x~2 >= 2);" "#res := 0;assume true;" "assume true;" "assume true;" "assume !true;" "assume !true;" "assume !true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" },
	returnAlphabet = {"return;" "return;" },
	states = {"2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "2998#(<= main_~x~2 oldRank0)" "3030#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "2974#unseeded" },
	initialStates = {"2974#unseeded" },
	finalStates = {"2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" },
	callTransitions = {
		 ("2974#unseeded" "call #t~ret4 := main();" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2974#unseeded" "call ULTIMATE.init();" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
	},
	internalTransitions = {
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;~x~2 := ~x~2 + 1;~y~2 := ~y~2 - 2;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~y~2 := ~y~2 - 1;" "2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))")
		 ("2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2998#(<= main_~x~2 oldRank0)")
		 ("2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "2998#(<= main_~x~2 oldRank0)")
		 ("2998#(<= main_~x~2 oldRank0)" "assume true;assume !!(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;~y~2 := ~y~2 - 1;" "2998#(<= main_~x~2 oldRank0)")
		 ("2998#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 3 && #t~nondet3 != 0);havoc #t~nondet3;" "2998#(<= main_~x~2 oldRank0)")
		 ("2998#(<= main_~x~2 oldRank0)" "~y~2 := ~y~2 - 1;" "2998#(<= main_~x~2 oldRank0)")
		 ("2998#(<= main_~x~2 oldRank0)" "assume true;assume !(~y~2 >= ~x~2 + 1 && #t~nondet2 != 0);havoc #t~nondet2;" "2998#(<= main_~x~2 oldRank0)")
		 ("2998#(<= main_~x~2 oldRank0)" "~x~2 := ~x~2 - 1;~y~2 := ~y~2 - ~x~2;" "3030#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))")
		 ("3030#(and (<= (+ main_~x~2 1) oldRank0) (<= main_~x~2 oldRank0))" "assume true;assume !!(~x~2 >= 2);~x~2 := ~x~2 - 1;~y~2 := ~y~2 + ~x~2;" "2997#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))")
	},
	returnTransitions = {
		 ("2977#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "2974#unseeded" "return;" "2974#unseeded")
	}
);


2019-05-11 07:10:01,955 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Timing statistics
2019-05-11 07:10:01,957 INFO  [BasicToolchainJob.java:95]:     BüchiAutomizer plugin needed 3.7s and 9 iterations. Analysis of lassos took 1.7s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization removed 208 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 181 states and ocurred in iteration 7.	Nontrivial modules had stage [5, 0, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 1/1	EdgeCheckerBenchmarkData: HoareTripleChecks: 14 SDtfs, 0 SDslu, 0 SDs, 0 lazy, 363 Sat,337 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.4s	LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks:   Termination: inital49 mio100 ax100 hnf94 lsp57 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf96 smp98 dnf182 smp96 tf103 neg100 sie100    Nontermination: inital49 mio100 ax100 hnf94 lsp57 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf96 smp98 dnf182 smp96 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 6 
2019-05-11 07:10:01,957 INFO  [BasicToolchainJob.java:89]:   - TerminationAnalysisResult: Termination proven
2019-05-11 07:10:01,957 INFO  [BasicToolchainJob.java:95]:     Buchi Automizer proved that your program is terminating
2019-05-11 07:10:01,957 INFO  [BasicToolchainJob.java:75]:  * Results from UltimateCore:
2019-05-11 07:10:01,958 INFO  [BasicToolchainJob.java:89]:   - BenchmarkResult: Toolchain Benchmarks
2019-05-11 07:10:01,964 INFO  [BasicToolchainJob.java:95]:     Benchmark results are:
 * CDTParser took 111.18 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB
 * CACSL2BoogieTranslator took 113.55 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB
 * Boogie Preprocessor took 26.67 ms. Allocated memory is still 514.9 MB. Free memory was 478.6 MB in the beginning and 477.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB
 * RCFGBuilder took 227.80 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.0 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 53.1 GB
 * BlockEncoding took 80.69 ms. Allocated memory is still 514.9 MB. Free memory was 464.0 MB in the beginning and 457.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB
 * TraceAbstraction took 98.90 ms. Allocated memory is still 514.9 MB. Free memory was 457.9 MB in the beginning and 451.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB
 * BuchiAutomizer took 3769.23 ms. Allocated memory was 514.9 MB in the beginning and 568.3 MB in the end (delta: 53.5 MB). Free memory was 451.1 MB in the beginning and 389.9 MB in the end (delta: 61.2 MB). Peak memory consumption was 114.7 MB. Max. memory is 53.1 GB
2019-05-11 07:10:01,992 INFO  [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0
Closed successfully