YES 2019-05-11 07:11:38,520 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:38,523 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,527 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,527 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:38,528 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:38,528 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:38,529 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:38,529 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:38,529 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:38,532 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:38,532 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:38,533 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:38,533 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:38,533 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:38,533 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,535 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:40,811 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:40,811 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:40,811 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:40,812 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:41,176 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:41,176 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,177 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:41,177 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:41,177 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,177 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:41,178 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,178 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:41,178 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:41,178 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:41,179 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:41,179 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:41,179 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:41,179 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:41,179 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:41,180 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:41,180 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:41,180 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:41,180 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:41,180 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:41,181 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:41,181 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:41,181 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:41,181 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:41,182 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:41,182 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:41,182 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:41,182 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:41,182 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:41,183 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:41,183 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,183 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,183 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,183 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,184 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:41,404 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:41,412 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:41,412 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:41,414 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:41,416 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:41,416 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:41,416 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:41,538 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:41,540 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:41,540 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,540 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:41,544 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:41,545 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,651 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,651 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,668 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:41,668 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:41,684 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,689 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,689 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,691 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,692 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,693 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,694 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,695 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:41,695 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:41,695 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:41,696 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,792 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:11:41,794 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:41,902 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:41,902 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:41,902 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:41,903 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:41,904 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,918 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:41,942 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,943 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,961 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:41,961 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:41,962 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:41,963 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:41,963 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:41" (1/5) ... 2019-05-11 07:11:41,964 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:41" (2/5) ... 2019-05-11 07:11:41,965 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:41" (3/5) ... 2019-05-11 07:11:41,965 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:41" (4/5) ... 2019-05-11 07:11:41,966 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:41" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:42,060 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:42,061 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:42,061 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:42,061 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:42,064 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:44,213 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:44,214 INFO [Benchmark.java:150]: Toolchain (without parser) took 2675.28 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 604.2 MB in the beginning and 505.4 MB in the end (delta: 98.8 MB). Peak memory consumption was 102.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,217 INFO [Benchmark.java:150]: CDTParser took 111.23 ms. Allocated memory is still 643.3 MB. Free memory was 612.3 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:11:44,218 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 110.78 ms. Allocated memory is still 643.3 MB. Free memory was 604.2 MB in the beginning and 600.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,219 INFO [Benchmark.java:150]: Boogie Preprocessor took 42.95 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,220 INFO [Benchmark.java:150]: RCFGBuilder took 207.26 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 583.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,220 INFO [Benchmark.java:150]: BlockEncoding took 59.24 ms. Allocated memory is still 643.3 MB. Free memory was 583.3 MB in the beginning and 579.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,221 INFO [Benchmark.java:150]: TraceAbstraction took 99.03 ms. Allocated memory is still 643.3 MB. Free memory was 579.3 MB in the beginning and 572.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,222 INFO [Benchmark.java:150]: BuchiAutomizer took 2152.81 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 572.6 MB in the beginning and 505.4 MB in the end (delta: 67.2 MB). Peak memory consumption was 70.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,229 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:11:44,229 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:44,229 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:44,229 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 18]: Loop Invariant 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:44,230 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:44,231 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:11:44,231 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:44,231 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:44,231 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (3 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function M + -1 * x + 0 and consists of 5 locations. One deterministic module has affine ranking function M + -1 * x + 0 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x + M + 0 and consists of 4 locations. One nondeterministic module has affine ranking function x + 0 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 2019-05-11 07:11:44,231 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:44,232 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "514#unseeded" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"514#unseeded" }, finalStates = {"529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("514#unseeded" "call #t~ret2 := main();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#unseeded" "call ULTIMATE.init();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume true;" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != ~M~2);" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "514#unseeded" "return;" "514#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "1210#unseeded" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "1227#(<= main_~x~2 oldRank0)" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" }, initialStates = {"1210#unseeded" }, finalStates = {"1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("1210#unseeded" "call #t~ret2 := main();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1210#unseeded" "call ULTIMATE.init();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != ~M~2);" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume ~x~2 > ~M~2;~x~2 := 0;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume !!(~x~2 != ~M~2);" "1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") }, returnTransitions = { ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1210#unseeded" "return;" "1210#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "1210#unseeded" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "1227#(<= main_~x~2 oldRank0)" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" }, initialStates = {"1210#unseeded" }, finalStates = {"1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("1210#unseeded" "call #t~ret2 := main();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1210#unseeded" "call ULTIMATE.init();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != ~M~2);" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume ~x~2 > ~M~2;~x~2 := 0;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume !!(~x~2 != ~M~2);" "1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") }, returnTransitions = { ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1210#unseeded" "return;" "1210#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, 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_~M~2 1) (+ main_~x~2 oldRank0)))" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))" }, initialStates = {"52#unseeded" }, finalStates = {"27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~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 ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "61#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~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 ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~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_~M~2 1) (+ main_~x~2 oldRank0)))" "assume !true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("61#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !(~x~2 != ~M~2);" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !true;" "27#false") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume true;" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume true;" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != ~M~2);" "62#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("62#(<= main_~M~2 (+ main_~x~2 oldRank0))" "#res := 0;assume true;" "62#(<= main_~M~2 (+ main_~x~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 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"184#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "169#unseeded" "185#(<= main_~M~2 (+ main_~x~2 oldRank0))" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"169#unseeded" }, finalStates = {"184#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("169#unseeded" "call #t~ret2 := main();" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("169#unseeded" "call ULTIMATE.init();" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("184#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "185#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("185#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume true;" "185#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("185#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != ~M~2);" "185#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("185#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "184#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "184#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") }, returnTransitions = { ("172#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "169#unseeded" "return;" "169#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "514#unseeded" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"514#unseeded" }, finalStates = {"529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" }, callTransitions = { ("514#unseeded" "call #t~ret2 := main();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("514#unseeded" "call ULTIMATE.init();" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))" "assume true;" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume true;" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !!(~x~2 != ~M~2);" "530#(<= main_~M~2 (+ main_~x~2 oldRank0))") ("530#(<= main_~M~2 (+ main_~x~2 oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "529#(and (<= 0 oldRank0) (<= (+ main_~M~2 1) (+ main_~x~2 oldRank0)))") ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("517#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "514#unseeded" "return;" "514#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 != ~M~2);" "assume true;" "assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume !(~M~2 > 0);" "#res := 0;assume true;" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~x~2 != ~M~2);" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "assume true;" "assume ~x~2 > ~M~2;~x~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "1210#unseeded" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "1227#(<= main_~x~2 oldRank0)" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" }, initialStates = {"1210#unseeded" }, finalStates = {"1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("1210#unseeded" "call #t~ret2 := main();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1210#unseeded" "call ULTIMATE.init();" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume true;" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume !!(~x~2 != ~M~2);" "1227#(<= main_~x~2 oldRank0)") ("1227#(<= main_~x~2 oldRank0)" "assume ~x~2 > ~M~2;~x~2 := 0;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~M~2;~x~2 := #t~nondet0;havoc #t~nondet0;~M~2 := #t~nondet1;havoc #t~nondet1;assume ~M~2 > 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~x~2 != ~M~2);" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~x~2 > ~M~2);~x~2 := ~x~2 + 1;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1226#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~x~2 > ~M~2;~x~2 := 0;" "1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume !!(~x~2 != ~M~2);" "1280#(and (<= 0 main_~x~2) (distinct main_~x~2 main_~M~2) (<= (+ main_~M~2 1) oldRank0))") ("1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))" "assume true;" "1247#(and (<= 0 main_~x~2) (<= (+ main_~M~2 1) oldRank0))") }, returnTransitions = { ("1213#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "1210#unseeded" "return;" "1210#unseeded") } ); 2019-05-11 07:11:44,233 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:44,234 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.1s and 6 iterations. Analysis of lassos took 0.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization removed 69 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 34/39 InterpolantCoveringCapabilityBuchi: 0/4 EdgeCheckerBenchmarkData: HoareTripleChecks: 27 SDtfs, 9 SDslu, 38 SDs, 0 lazy, 294 Sat,202 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.2s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital14 mio100 ax100 hnf93 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf110 smp65 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital14 mio100 ax100 hnf93 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf110 smp65 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:44,234 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:44,234 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:44,234 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:44,234 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:44,241 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.23 ms. Allocated memory is still 643.3 MB. Free memory was 612.3 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 110.78 ms. Allocated memory is still 643.3 MB. Free memory was 604.2 MB in the beginning and 600.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 42.95 ms. Allocated memory is still 643.3 MB. Free memory was 600.2 MB in the beginning and 598.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 207.26 ms. Allocated memory is still 643.3 MB. Free memory was 598.9 MB in the beginning and 583.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB * BlockEncoding took 59.24 ms. Allocated memory is still 643.3 MB. Free memory was 583.3 MB in the beginning and 579.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 99.03 ms. Allocated memory is still 643.3 MB. Free memory was 579.3 MB in the beginning and 572.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2152.81 ms. Allocated memory was 643.3 MB in the beginning and 646.4 MB in the end (delta: 3.1 MB). Free memory was 572.6 MB in the beginning and 505.4 MB in the end (delta: 67.2 MB). Peak memory consumption was 70.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:44,267 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully