YES 2019-05-11 07:09:41,996 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:41,999 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,002 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,002 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:42,003 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:42,004 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:42,004 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:42,004 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:42,005 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:42,007 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:42,007 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:42,008 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:42,008 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:42,008 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:42,009 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:42,011 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:44,333 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:44,334 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:44,334 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:44,334 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:44,685 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:44,685 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:44,686 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:44,686 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:44,686 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:44,686 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:44,687 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:44,687 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:44,687 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:44,687 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:44,687 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:44,688 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:44,688 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:44,688 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:44,688 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:44,688 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:44,689 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:44,689 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:44,689 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:44,689 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:44,690 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:44,690 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:44,690 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:44,690 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:44,690 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:44,690 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:44,691 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:44,691 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:44,691 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:44,691 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:44,691 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:44,692 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:44,692 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:44,692 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:44,692 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:44,907 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:44,915 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:44,915 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:44,918 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:44,919 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:44,919 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:44,920 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:09:45,041 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:45,043 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:45,043 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:45,044 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:45,047 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:45,048 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:45,155 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:45,155 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:45,156 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:45,156 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:45,171 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:45" (1/1) ... 2019-05-11 07:09:45,176 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:45" (1/1) ... 2019-05-11 07:09:45,176 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:45" (1/1) ... 2019-05-11 07:09:45,178 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:45" (1/1) ... 2019-05-11 07:09:45,179 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:45" (1/1) ... 2019-05-11 07:09:45,180 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:45" (1/1) ... 2019-05-11 07:09:45,181 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:45,181 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:45,181 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:45,181 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:45,182 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:45" (1/1) ... 2019-05-11 07:09:45,277 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:45,279 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:45,389 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:45,389 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:45,389 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:45,390 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:45,391 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:45" (1/1) ... 2019-05-11 07:09:45,404 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:45" (1/1) ... 2019-05-11 07:09:45,428 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:45,429 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:45,449 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:45,450 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:45,450 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:45,451 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:45,451 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:45" (1/5) ... 2019-05-11 07:09:45,452 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:45" (2/5) ... 2019-05-11 07:09:45,453 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:45" (3/5) ... 2019-05-11 07:09:45,453 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:45" (4/5) ... 2019-05-11 07:09:45,454 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:45" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:45,550 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:45,550 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:45,550 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:45,551 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:45,553 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:09:45" (1/1) ... 2019-05-11 07:09:46,874 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:46,875 INFO [Benchmark.java:150]: Toolchain (without parser) took 1832.91 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 412.7 MB in the end (delta: 191.5 MB). Peak memory consumption was 191.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,877 INFO [Benchmark.java:150]: CDTParser took 110.77 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,878 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.66 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,879 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,880 INFO [Benchmark.java:150]: RCFGBuilder took 207.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,880 INFO [Benchmark.java:150]: BlockEncoding took 60.37 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 578.5 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:09:46,881 INFO [Benchmark.java:150]: TraceAbstraction took 100.50 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 571.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,882 INFO [Benchmark.java:150]: BuchiAutomizer took 1323.87 ms. Allocated memory is still 643.3 MB. Free memory was 571.9 MB in the beginning and 412.7 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,888 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:09:46,888 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:46,888 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:46,889 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function x + -1 * y + 0 and consists of 5 locations. One deterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. One deterministic module has affine ranking function y + -1 * x + 0 and consists of 4 locations. One deterministic module has affine ranking function -1 * x + y + 0 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. 2019-05-11 07:09:46,890 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:46,891 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "205#unseeded" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))" }, initialStates = {"205#unseeded" }, finalStates = {"220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("205#unseeded" "call #t~ret2 := main();" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("205#unseeded" "call ULTIMATE.init();" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("208#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "205#unseeded" "return;" "205#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "493#unseeded" }, initialStates = {"493#unseeded" }, finalStates = {"506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("493#unseeded" "call #t~ret2 := main();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("493#unseeded" "call ULTIMATE.init();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("496#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") }, returnTransitions = { ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "493#unseeded" "return;" "493#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))" }, initialStates = {"52#unseeded" }, finalStates = {"27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("52#unseeded" "call #t~ret2 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("52#unseeded" "assume true;" "52#unseeded") ("55#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(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;assume !(~x~2 >= 0 && ~y~2 >= 0);" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("27#false" "assume true;" "27#false") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume !true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !true;" "27#false") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("62#(<= main_~x~2 (+ main_~y~2 oldRank0))" "#res := 0;assume true;" "62#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("27#false" "52#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "205#unseeded" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))" }, initialStates = {"205#unseeded" }, finalStates = {"220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("205#unseeded" "call #t~ret2 := main();" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("205#unseeded" "call ULTIMATE.init();" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("208#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume true;" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "221#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("221#(<= main_~x~2 (+ main_~y~2 oldRank0))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "220#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("208#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "205#unseeded" "return;" "205#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "359#(<= main_~y~2 (+ main_~x~2 oldRank0))" "348#unseeded" "351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"348#unseeded" }, finalStates = {"358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("348#unseeded" "call #t~ret2 := main();" "351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("348#unseeded" "call ULTIMATE.init();" "351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "359#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "359#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("359#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume true;" "359#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("359#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "359#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("359#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" "358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("351#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "358#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") }, returnTransitions = { ("351#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "348#unseeded" "return;" "348#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "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 !(~x~2 >= 0 && ~y~2 >= 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;assume ~x~2 >= 0 && ~y~2 >= 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "assume true;" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "493#unseeded" }, initialStates = {"493#unseeded" }, finalStates = {"506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("493#unseeded" "call #t~ret2 := main();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("493#unseeded" "call ULTIMATE.init();" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("496#(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;assume ~x~2 >= 0 && ~y~2 >= 0;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 < ~y~2);~y~2 := ~y~2 + 1;" "496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") ("506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume true;" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 - ~y~2 > 2 || ~y~2 - ~x~2 > 2);" "507#(<= main_~y~2 (+ main_~x~2 oldRank0))") ("507#(<= main_~y~2 (+ main_~x~2 oldRank0))" "assume ~x~2 < ~y~2;~x~2 := ~x~2 + 1;" "506#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) (+ main_~x~2 oldRank0)))") }, returnTransitions = { ("496#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "493#unseeded" "return;" "493#unseeded") } ); 2019-05-11 07:09:46,892 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:46,893 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.2s and 5 iterations. Analysis of lassos took 0.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization removed 16 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 7/7 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 20 SDtfs, 2 SDslu, 25 SDs, 0 lazy, 118 Sat,79 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital12 mio100 ax100 hnf100 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital12 mio100 ax100 hnf100 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:09:46,893 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:46,893 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:46,894 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:46,894 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:46,900 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.77 ms. Allocated memory is still 643.3 MB. Free memory was 612.2 MB in the beginning and 605.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.66 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.31 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 207.93 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 582.5 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 53.1 GB * BlockEncoding took 60.37 ms. Allocated memory is still 643.3 MB. Free memory was 582.5 MB in the beginning and 578.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 100.50 ms. Allocated memory is still 643.3 MB. Free memory was 578.5 MB in the beginning and 571.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1323.87 ms. Allocated memory is still 643.3 MB. Free memory was 571.9 MB in the beginning and 412.7 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 53.1 GB 2019-05-11 07:09:46,926 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully