YES 2019-05-11 07:09:02,396 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:09:02,399 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:09:02,402 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:09:02,402 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:09:02,403 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:09:02,404 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:09:02,404 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:09:02,404 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:09:02,405 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:09:02,408 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:09:02,408 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:09:02,408 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:09:02,409 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:09:02,409 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:09:02,409 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:09:02,410 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:09:05,556 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:09:05,557 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:09:05,557 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:09:05,557 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:09:05,915 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:09:05,916 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:09:05,916 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:09:05,917 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:09:05,917 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:05,917 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:09:05,917 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:09:05,917 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:09:05,918 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:09:05,918 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:09:05,918 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:09:05,918 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:09:05,918 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:09:05,919 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:09:05,919 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:09:05,919 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:09:05,919 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:09:05,919 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:09:05,920 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:09:05,920 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:09:05,920 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:09:05,920 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:09:05,920 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:09:05,921 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:09:05,921 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:09:05,921 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:09:05,921 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:09:05,921 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:05,922 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:09:05,922 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:09:05,922 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:05,922 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:05,922 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:09:05,923 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:09:05,923 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:09:06,141 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:09:06,149 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:06,150 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:09:06,152 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:09:06,153 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:09:06,154 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:09:06,154 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:09:06,277 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:09:06,279 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:09:06,280 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:06,280 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:09:06,284 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:09:06,284 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,391 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:09:06,392 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:09:06,392 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:09:06,392 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:09:06,408 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,413 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,413 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,415 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,416 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,417 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,418 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:09:06,418 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:09:06,418 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:09:06,418 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:09:06,420 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,518 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:09:06,521 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:09:06,629 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:09:06,630 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:09:06,630 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:09:06,631 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:09:06,631 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,646 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:06,681 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:06,682 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:06,683 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:06,684 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:09:06,685 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:09:06,685 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:09:06,685 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:09:06,686 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:09:06,687 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:09:06" (1/5) ... 2019-05-11 07:09:06,688 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:09:06" (2/5) ... 2019-05-11 07:09:06,688 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:09:06" (3/5) ... 2019-05-11 07:09:06,689 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:09:06" (4/5) ... 2019-05-11 07:09:06,689 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:09:06" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:09:06,787 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:09:06,787 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:09:06,787 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:09:06,788 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:09:06,790 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.05 07:09:06" (1/1) ... 2019-05-11 07:09:08,119 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:09:08,120 INFO [Benchmark.java:150]: Toolchain (without parser) took 1842.34 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 413.3 MB in the end (delta: 190.8 MB). Peak memory consumption was 190.8 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,122 INFO [Benchmark.java:150]: CDTParser took 112.64 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,124 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.59 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,124 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,125 INFO [Benchmark.java:150]: RCFGBuilder took 211.39 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 583.2 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:09:08,126 INFO [Benchmark.java:150]: BlockEncoding took 54.97 ms. Allocated memory is still 643.3 MB. Free memory was 583.2 MB in the beginning and 579.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:09:08,126 INFO [Benchmark.java:150]: TraceAbstraction took 101.92 ms. Allocated memory is still 643.3 MB. Free memory was 579.2 MB in the beginning and 573.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,127 INFO [Benchmark.java:150]: BuchiAutomizer took 1332.62 ms. Allocated memory is still 643.3 MB. Free memory was 573.8 MB in the beginning and 413.3 MB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,134 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:09:08,135 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:09:08,135 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:09:08,135 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:09:08,135 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:09:08,135 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:09:08,135 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 12]: Loop Invariant 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 10]: Loop Invariant 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:09:08,136 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:09:08,137 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:09:08,137 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:09:08,137 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:09:08,137 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 x + 0 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 6 locations. 2019-05-11 07:09:08,137 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:09:08,137 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "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;" "#res := 0;assume true;" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))" "423#unseeded" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"423#unseeded" }, finalStates = {"433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("423#unseeded" "call #t~ret1 := main();" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("423#unseeded" "call ULTIMATE.init();" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("434#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 1;" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~x~2);" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(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;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "423#unseeded" "return;" "423#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "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;" "#res := 0;assume true;" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "118#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "109#unseeded" }, initialStates = {"109#unseeded" }, finalStates = {"118#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("109#unseeded" "call #t~ret1 := main();" "112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("109#unseeded" "call ULTIMATE.init();" "112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("112#(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;" "118#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("118#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "assume true;assume !(~y~2 < ~x~2);" "122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))") ("122#(and (<= 1 main_~x~2) (<= main_~x~2 oldRank0))" "~x~2 := ~x~2 - 1;" "118#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") }, returnTransitions = { ("112#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "109#unseeded" "return;" "109#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "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;" "#res := 0;assume true;" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "186#(<= main_~x~2 (+ main_~y~2 oldRank0))" "175#unseeded" }, initialStates = {"175#unseeded" }, finalStates = {"185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("175#unseeded" "call #t~ret1 := main();" "178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("175#unseeded" "call ULTIMATE.init();" "178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("178#(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;" "178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("185#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "186#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("186#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 1;" "186#(<= main_~x~2 (+ main_~y~2 oldRank0))") }, returnTransitions = { ("178#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "175#unseeded" "return;" "175#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "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;" "#res := 0;assume true;" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" }, returnAlphabet = {"return;" "return;" }, states = {"433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))" "423#unseeded" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"423#unseeded" }, finalStates = {"433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" }, callTransitions = { ("423#unseeded" "call #t~ret1 := main();" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("423#unseeded" "call ULTIMATE.init();" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))" "assume true;assume !(~y~2 < ~x~2);" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("434#(<= main_~x~2 (+ main_~y~2 oldRank0))" "~x~2 := ~x~2 - 1;" "434#(<= main_~x~2 (+ main_~y~2 oldRank0))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~y~2 < ~x~2);~y~2 := ~y~2 + 1;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~y~2 < ~x~2);" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~x~2 := ~x~2 - 1;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(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;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "433#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) (+ main_~y~2 oldRank0)))") ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~x~2 > 0);~y~2 := 0;" "426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("426#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "423#unseeded" "return;" "423#unseeded") } ); 2019-05-11 07:09:08,138 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:09:08,139 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.3s and 6 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 1/2 InterpolantCoveringCapabilityBuchi: 1/1 EdgeCheckerBenchmarkData: HoareTripleChecks: 19 SDtfs, 0 SDslu, 3 SDs, 0 lazy, 69 Sat,75 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital12 mio100 ax100 hnf111 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp95 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital12 mio100 ax100 hnf111 lsp100 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp95 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:09:08,139 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:09:08,139 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:09:08,139 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:09:08,139 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:09:08,145 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 112.64 ms. Allocated memory is still 643.3 MB. Free memory was 612.1 MB in the beginning and 605.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 111.59 ms. Allocated memory is still 643.3 MB. Free memory was 604.1 MB in the beginning and 600.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.85 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 211.39 ms. Allocated memory is still 643.3 MB. Free memory was 598.7 MB in the beginning and 583.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB * BlockEncoding took 54.97 ms. Allocated memory is still 643.3 MB. Free memory was 583.2 MB in the beginning and 579.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 101.92 ms. Allocated memory is still 643.3 MB. Free memory was 579.2 MB in the beginning and 573.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1332.62 ms. Allocated memory is still 643.3 MB. Free memory was 573.8 MB in the beginning and 413.3 MB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 53.1 GB 2019-05-11 07:09:08,171 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully