YES 2019-05-11 07:11:39,627 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:39,630 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,634 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,634 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:39,635 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:39,635 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:39,635 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:39,636 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:39,636 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:39,638 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:39,639 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:39,639 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:39,639 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:39,640 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:39,640 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:39,641 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:41,757 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:41,757 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:41,757 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,757 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:42,112 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:42,113 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:42,113 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:42,114 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:42,114 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:42,114 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:42,114 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:42,115 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:42,115 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:42,115 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:42,115 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:42,115 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:42,116 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:42,116 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:42,116 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:42,116 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:42,116 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:42,117 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:42,117 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:42,117 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:42,118 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:42,118 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:42,118 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:42,118 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:42,118 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:42,119 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:42,119 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:42,119 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:42,119 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:42,119 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:42,120 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:42,120 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:42,120 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:42,120 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:42,121 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:42,361 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:42,368 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:42,369 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:42,372 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:42,373 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:42,373 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:42,374 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:42,501 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:42,503 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:42,503 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:42,503 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:42,507 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:42,507 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:42" (1/1) ... 2019-05-11 07:11:42,615 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:42,615 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:42,615 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:42,616 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:42,631 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:42" (1/1) ... 2019-05-11 07:11:42,635 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:42" (1/1) ... 2019-05-11 07:11:42,636 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:42" (1/1) ... 2019-05-11 07:11:42,637 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:42" (1/1) ... 2019-05-11 07:11:42,638 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:42" (1/1) ... 2019-05-11 07:11:42,639 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:42" (1/1) ... 2019-05-11 07:11:42,640 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:42,640 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:42,641 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:42,641 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:42,642 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:42" (1/1) ... 2019-05-11 07:11:42,734 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:42,736 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:42,847 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:42,848 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:42,848 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:42,849 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:42,849 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:42" (1/1) ... 2019-05-11 07:11:42,863 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:42" (1/1) ... 2019-05-11 07:11:42,915 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,916 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,917 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,917 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:42,918 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:42,918 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:42,919 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:42,920 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:42,920 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:42" (1/5) ... 2019-05-11 07:11:42,921 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:42" (2/5) ... 2019-05-11 07:11:42,921 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:42" (3/5) ... 2019-05-11 07:11:42,922 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:42" (4/5) ... 2019-05-11 07:11:42,922 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:42" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:43,008 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:43,008 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:43,008 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:43,008 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:43,011 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:43" (1/1) ... 2019-05-11 07:11:45,057 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:45,058 INFO [Benchmark.java:150]: Toolchain (without parser) took 2556.42 ms. Allocated memory was 514.9 MB in the beginning and 567.3 MB in the end (delta: 52.4 MB). Free memory was 483.4 MB in the beginning and 482.8 MB in the end (delta: 549.8 kB). Peak memory consumption was 53.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,060 INFO [Benchmark.java:150]: CDTParser took 115.94 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,061 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.17 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,062 INFO [Benchmark.java:150]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 514.9 MB. Free memory was 478.7 MB in the beginning and 477.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,063 INFO [Benchmark.java:150]: RCFGBuilder took 207.18 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,064 INFO [Benchmark.java:150]: BlockEncoding took 70.44 ms. Allocated memory is still 514.9 MB. Free memory was 464.6 MB in the beginning and 459.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,064 INFO [Benchmark.java:150]: TraceAbstraction took 89.39 ms. Allocated memory is still 514.9 MB. Free memory was 459.2 MB in the beginning and 453.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,065 INFO [Benchmark.java:150]: BuchiAutomizer took 2049.05 ms. Allocated memory was 514.9 MB in the beginning and 567.3 MB in the end (delta: 52.4 MB). Free memory was 453.1 MB in the beginning and 482.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,072 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:45,072 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:45,072 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:45,072 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:45,072 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:45,072 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:45,073 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 14]: Procedure Contract for main 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 22]: Loop Invariant 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 24]: Loop Invariant 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:45,073 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:45,074 INFO [BasicToolchainJob.java:95]: CFG has 13 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 13 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:45,074 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:45,074 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:45,074 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + 0 and consists of 7 locations. One deterministic module has affine ranking function n + -1 * i + 0 and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. 2019-05-11 07:11:45,074 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:45,074 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration1 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret4 := main();" }, internalAlphabet = {"assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "assume true;assume !(~j~2 <= ~i~2);" "~i~2 := ~i~2 + 1;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "#res := 0;assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"80#unseeded" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "55#false" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "91#(<= 0 (+ main_~i~2 oldRank0))" "111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))" }, initialStates = {"80#unseeded" }, finalStates = {"55#false" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" }, callTransitions = { ("80#unseeded" "call ULTIMATE.init();" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("80#unseeded" "call #t~ret4 := main();" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("80#unseeded" "assume true;" "80#unseeded") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume true;assume !(~j~2 <= ~i~2);" "111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume !true;" "55#false") ("55#false" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "55#false") ("55#false" "assume true;assume !(~j~2 <= ~i~2);" "55#false") ("55#false" "~i~2 := ~i~2 + 1;" "55#false") ("55#false" "#res := 0;assume true;" "55#false") ("55#false" "assume true;assume !(~i~2 < ~n~2);" "55#false") ("55#false" "assume true;" "55#false") ("55#false" "assume !true;" "55#false") ("55#false" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "55#false") ("55#false" "assume !true;" "55#false") ("55#false" "assume true;" "55#false") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume true;assume !(~i~2 < ~n~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume !true;" "55#false") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !(~j~2 <= ~i~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "~i~2 := ~i~2 + 1;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "#res := 0;assume true;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !(~i~2 < ~n~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))") ("111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))" "~i~2 := ~i~2 + 1;" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))") }, returnTransitions = { ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "80#unseeded" "return;" "80#unseeded") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "80#unseeded" "return;" "80#unseeded") ("55#false" "80#unseeded" "return;" "55#false") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret4 := main();" }, internalAlphabet = {"assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "assume true;assume !(~j~2 <= ~i~2);" "~i~2 := ~i~2 + 1;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "#res := 0;assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"80#unseeded" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "55#false" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "91#(<= 0 (+ main_~i~2 oldRank0))" "111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))" }, initialStates = {"80#unseeded" }, finalStates = {"55#false" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" }, callTransitions = { ("80#unseeded" "call ULTIMATE.init();" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("80#unseeded" "call #t~ret4 := main();" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("80#unseeded" "assume true;" "80#unseeded") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume true;assume !(~j~2 <= ~i~2);" "111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))") ("101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))" "assume !true;" "55#false") ("55#false" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "55#false") ("55#false" "assume true;assume !(~j~2 <= ~i~2);" "55#false") ("55#false" "~i~2 := ~i~2 + 1;" "55#false") ("55#false" "#res := 0;assume true;" "55#false") ("55#false" "assume true;assume !(~i~2 < ~n~2);" "55#false") ("55#false" "assume true;" "55#false") ("55#false" "assume !true;" "55#false") ("55#false" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "55#false") ("55#false" "assume !true;" "55#false") ("55#false" "assume true;" "55#false") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume true;assume !(~i~2 < ~n~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume !true;" "55#false") ("90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !(~j~2 <= ~i~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "~i~2 := ~i~2 + 1;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "#res := 0;assume true;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !(~i~2 < ~n~2);" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= 0 (+ main_~i~2 oldRank0))") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= 0 (+ main_~i~2 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "101#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)))") ("111#(and (<= main_~j~2 0) (<= 0 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) 0))" "~i~2 := ~i~2 + 1;" "90#(and (<= 0 oldRank0) (<= 1 (+ main_~i~2 oldRank0)))") }, returnTransitions = { ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "80#unseeded" "return;" "80#unseeded") ("83#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "80#unseeded" "return;" "80#unseeded") ("55#false" "80#unseeded" "return;" "55#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret4 := main();" }, internalAlphabet = {"assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "assume true;assume !(~j~2 <= ~i~2);" "~i~2 := ~i~2 + 1;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "#res := 0;assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"224#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "215#unseeded" "218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"215#unseeded" }, finalStates = {"224#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("215#unseeded" "call ULTIMATE.init();" "218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("215#unseeded" "call #t~ret4 := main();" "218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("224#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;assume !(~j~2 <= ~i~2);" "228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("228#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "~i~2 := ~i~2 + 1;" "224#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "224#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("218#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "215#unseeded" "return;" "215#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret4 := main();" }, internalAlphabet = {"assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "assume true;assume !(~j~2 <= ~i~2);" "~i~2 := ~i~2 + 1;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "#res := 0;assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "307#(and (<= 1 main_~k~2) (<= (+ (* 2 main_~i~2) 1) (+ (* 2 main_~j~2) oldRank0)))" "293#unseeded" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "302#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"293#unseeded" }, finalStates = {"306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" }, callTransitions = { ("293#unseeded" "call ULTIMATE.init();" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("293#unseeded" "call #t~ret4 := main();" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))") ("306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "assume true;assume !(~j~2 <= ~i~2);" "307#(and (<= 1 main_~k~2) (<= (+ (* 2 main_~i~2) 1) (+ (* 2 main_~j~2) oldRank0)))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "302#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("302#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "306#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))") }, returnTransitions = { ("296#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "293#unseeded" "return;" "293#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret4 := main();" }, internalAlphabet = {"assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "assume true;assume !(~j~2 <= ~i~2);" "~i~2 := ~i~2 + 1;" "assume true;assume !(~i~2 < ~n~2);" "assume true;" "assume !true;" "assume true;" "assume !true;" "assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume !(~k~2 >= 1);" "#res := 0;assume true;" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "547#(and (<= 1 main_~k~2) (<= (+ (* 2 main_~i~2) 1) (+ (* 2 main_~j~2) oldRank0)))" "533#unseeded" "536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"533#unseeded" }, finalStates = {"546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" }, callTransitions = { ("533#unseeded" "call ULTIMATE.init();" "536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("533#unseeded" "call #t~ret4 := main();" "536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))") ("546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))" "assume true;assume !(~j~2 <= ~i~2);" "547#(and (<= 1 main_~k~2) (<= (+ (* 2 main_~i~2) 1) (+ (* 2 main_~j~2) oldRank0)))") ("536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~k~2;havoc ~i~2;havoc ~j~2;havoc ~n~2;~k~2 := #t~nondet0;havoc #t~nondet0;~i~2 := #t~nondet1;havoc #t~nondet1;~j~2 := #t~nondet2;havoc #t~nondet2;~n~2 := #t~nondet3;havoc #t~nondet3;assume ~k~2 >= 1;~i~2 := 0;" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 <= ~i~2);~j~2 := ~j~2 + ~k~2;" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 <= ~i~2);" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 + 1;" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "546#(and (<= 1 main_~k~2) (<= 0 oldRank0) (<= (+ (* 2 main_~i~2) 2) (+ (* 2 main_~j~2) oldRank0)))") ("542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 < ~n~2);~j~2 := 0;" "542#(and (<= 1 main_~k~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("536#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "533#unseeded" "return;" "533#unseeded") } ); 2019-05-11 07:11:45,075 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:45,076 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.0s and 5 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization removed 7 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 4 SDtfs, 3 SDslu, 6 SDs, 0 lazy, 130 Sat,111 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital16 mio100 ax100 hnf108 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 Nontermination: inital16 mio100 ax100 hnf108 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 85ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:11:45,076 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:45,076 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:45,076 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:45,076 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:45,083 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 115.94 ms. Allocated memory is still 514.9 MB. Free memory was 490.1 MB in the beginning and 484.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.17 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 478.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 24.97 ms. Allocated memory is still 514.9 MB. Free memory was 478.7 MB in the beginning and 477.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 207.18 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 53.1 GB * BlockEncoding took 70.44 ms. Allocated memory is still 514.9 MB. Free memory was 464.6 MB in the beginning and 459.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * TraceAbstraction took 89.39 ms. Allocated memory is still 514.9 MB. Free memory was 459.2 MB in the beginning and 453.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2049.05 ms. Allocated memory was 514.9 MB in the beginning and 567.3 MB in the end (delta: 52.4 MB). Free memory was 453.1 MB in the beginning and 482.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:45,109 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully