YES 2019-05-11 07:11:38,533 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:38,536 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,539 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,540 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:38,541 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:38,541 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:38,541 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:38,542 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:38,542 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:38,544 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:38,545 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:38,545 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:38,545 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:38,545 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:38,546 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:38,547 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:40,767 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:40,767 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:40,768 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:40,768 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:41,121 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:41,121 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:41,122 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:41,122 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:41,122 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,122 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:41,122 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:41,123 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:41,123 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:41,123 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:41,123 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:41,123 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:41,124 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:41,124 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:41,124 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:41,124 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:41,124 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:41,125 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:41,125 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:41,125 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:41,125 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:41,125 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:41,125 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:41,126 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:41,126 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:41,126 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:41,126 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:41,126 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,127 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:41,127 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:41,127 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,127 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,127 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:41,128 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:41,128 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:41,343 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:41,349 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:41,350 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:41,352 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:41,354 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:41,354 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:41,354 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:41,487 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:41,488 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:41,489 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,489 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:41,492 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:41,493 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,599 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:41,599 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,600 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:41,600 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:41,615 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,620 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,620 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,622 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,623 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,624 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,625 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:41,625 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:41,625 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:41,626 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:41,627 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,721 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,724 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,838 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:41,838 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:41,838 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:41,840 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:41,840 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,854 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,888 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,890 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,891 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,892 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:41,893 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:41,894 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:41,894 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:41,895 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:41,895 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" (1/5) ... 2019-05-11 07:11:41,896 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:41" (2/5) ... 2019-05-11 07:11:41,896 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:41" (3/5) ... 2019-05-11 07:11:41,897 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" (4/5) ... 2019-05-11 07:11:41,897 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" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:41,994 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:41,994 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:41,994 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:41,995 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:41,997 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:11:41" (1/1) ... 2019-05-11 07:11:43,927 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:43,928 INFO [Benchmark.java:150]: Toolchain (without parser) took 2440.31 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 585.4 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,930 INFO [Benchmark.java:150]: CDTParser took 121.81 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,931 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 110.40 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,931 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,932 INFO [Benchmark.java:150]: RCFGBuilder took 212.60 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,933 INFO [Benchmark.java:150]: BlockEncoding took 55.24 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:43,934 INFO [Benchmark.java:150]: TraceAbstraction took 100.53 ms. Allocated memory is still 649.6 MB. Free memory was 585.1 MB in the beginning and 579.6 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:43,934 INFO [Benchmark.java:150]: BuchiAutomizer took 1932.62 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 585.4 MB in the end (delta: -5.8 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:43,940 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:43,941 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:43,941 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:43,941 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:43,941 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:43,941 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:43,942 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:43,942 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:43,943 INFO [BasicToolchainJob.java:95]: CFG has 12 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 12 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:43,943 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:43,943 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:43,943 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y + x + 0 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. 2019-05-11 07:11:43,943 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:43,943 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume !true;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "149#unseeded" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"149#unseeded" }, finalStates = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("149#unseeded" "call #t~ret2 := main();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("149#unseeded" "call ULTIMATE.init();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "149#unseeded" "return;" "149#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume !true;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "149#unseeded" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"149#unseeded" }, finalStates = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("149#unseeded" "call #t~ret2 := main();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("149#unseeded" "call ULTIMATE.init();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "149#unseeded" "return;" "149#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume !true;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "77#unseeded" }, initialStates = {"77#unseeded" }, finalStates = {"86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" }, callTransitions = { ("77#unseeded" "call #t~ret2 := main();" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("77#unseeded" "call ULTIMATE.init();" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") ("86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "assume true;assume !(~y~2 < ~x~2);" "90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))") ("90#(and (<= 0 main_~x~2) (<= (+ (* 2 main_~x~2) 1) oldRank0))" "~x~2 := ~x~2 - 1;" "86#(and (<= 0 oldRank0) (<= (+ (* 2 main_~x~2) 2) oldRank0))") }, returnTransitions = { ("80#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "77#unseeded" "return;" "77#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume !true;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "149#unseeded" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"149#unseeded" }, finalStates = {"160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("149#unseeded" "call #t~ret2 := main();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("149#unseeded" "call ULTIMATE.init();" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "161#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "160#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") }, returnTransitions = { ("152#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "149#unseeded" "return;" "149#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "assume !true;" "assume true;assume !(~y~2 < ~x~2);" "assume true;" "~x~2 := ~x~2 - 1;" "assume true;" "assume true;assume !(~x~2 >= 0);" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "#res := 0;assume true;" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" }, returnAlphabet = {"return;" "return;" }, states = {"546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "547#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "535#unseeded" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"535#unseeded" }, finalStates = {"546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("535#unseeded" "call #t~ret2 := main();" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("535#unseeded" "call ULTIMATE.init();" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "547#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("547#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))" "~x~2 := ~x~2 - 1;" "547#(and (<= main_~x~2 (+ main_~y~2 oldRank0)) (<= 1 main_~y~2))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := 2 * ~y~2;" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~x~2);" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "546#(and (<= 0 oldRank0) (<= 1 main_~y~2) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 >= 0);~y~2 := 1;" "538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("538#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "535#unseeded" "return;" "535#unseeded") } ); 2019-05-11 07:11:43,944 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:43,945 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.9s and 7 iterations. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization removed 9 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 2/6 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 27 SDtfs, 5 SDslu, 30 SDs, 0 lazy, 137 Sat,91 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital13 mio100 ax100 hnf113 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 Nontermination: inital13 mio100 ax100 hnf113 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 99ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:11:43,945 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:43,945 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:43,946 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:43,946 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:43,952 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 121.81 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 110.40 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.74 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 212.60 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 589.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 53.1 GB * BlockEncoding took 55.24 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 100.53 ms. Allocated memory is still 649.6 MB. Free memory was 585.1 MB in the beginning and 579.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1932.62 ms. Allocated memory is still 649.6 MB. Free memory was 579.6 MB in the beginning and 585.4 MB in the end (delta: -5.8 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:43,978 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully