YES 2019-05-11 07:11:53,467 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:53,470 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:53,474 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:53,474 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:53,475 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:53,475 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:53,475 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:53,476 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:53,476 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:53,479 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:53,479 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:53,480 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:53,480 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:53,481 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:53,481 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:53,482 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:54,654 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:54,655 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:54,655 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:54,655 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:55,003 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:55,003 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:55,004 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:55,004 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:55,004 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:55,004 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:55,004 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:55,005 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:55,005 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:55,005 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:55,005 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:55,005 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:55,005 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:55,006 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:55,006 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:55,006 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:55,006 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:55,006 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:55,007 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:55,007 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:55,007 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:55,007 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:55,007 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:55,007 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:55,008 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:55,008 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:55,008 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:55,008 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:55,008 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:55,009 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:55,009 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:55,009 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:55,009 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:55,009 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:55,010 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:55,224 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:55,230 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:55,231 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:55,233 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:55,234 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:55,235 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:55,235 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:55,356 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:55,358 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:55,359 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:55,359 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:55,362 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:55,363 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:55" (1/1) ... 2019-05-11 07:11:55,469 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:55,470 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:55,470 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:55,470 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:55,486 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:55" (1/1) ... 2019-05-11 07:11:55,491 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:55" (1/1) ... 2019-05-11 07:11:55,491 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:55" (1/1) ... 2019-05-11 07:11:55,492 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:55" (1/1) ... 2019-05-11 07:11:55,494 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:55" (1/1) ... 2019-05-11 07:11:55,494 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:55" (1/1) ... 2019-05-11 07:11:55,495 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:55,496 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:55,496 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:55,496 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:55,497 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:55" (1/1) ... 2019-05-11 07:11:55,592 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:55,594 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:55,704 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:55,704 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:55,704 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:55,705 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:55,706 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:55" (1/1) ... 2019-05-11 07:11:55,719 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:55" (1/1) ... 2019-05-11 07:11:55,735 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:55,736 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:55,763 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:55,763 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:55,764 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:55,765 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:55,765 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:55" (1/5) ... 2019-05-11 07:11:55,766 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:55" (2/5) ... 2019-05-11 07:11:55,766 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:55" (3/5) ... 2019-05-11 07:11:55,767 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:55" (4/5) ... 2019-05-11 07:11:55,767 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:55" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:55,870 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:55,871 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:55,871 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:55,871 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:55,874 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:55" (1/1) ... 2019-05-11 07:11:56,791 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:56,792 INFO [Benchmark.java:150]: Toolchain (without parser) took 1434.88 ms. Allocated memory is still 514.9 MB. Free memory was 483.4 MB in the beginning and 479.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:56,794 INFO [Benchmark.java:150]: CDTParser took 110.64 ms. Allocated memory is still 514.9 MB. Free memory was 490.2 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:56,795 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.31 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.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:56,796 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.51 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:56,797 INFO [Benchmark.java:150]: RCFGBuilder took 207.97 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:56,798 INFO [Benchmark.java:150]: BlockEncoding took 59.38 ms. Allocated memory is still 514.9 MB. Free memory was 464.9 MB in the beginning and 460.9 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:56,798 INFO [Benchmark.java:150]: TraceAbstraction took 106.84 ms. Allocated memory is still 514.9 MB. Free memory was 460.9 MB in the beginning and 454.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:56,799 INFO [Benchmark.java:150]: BuchiAutomizer took 920.65 ms. Allocated memory is still 514.9 MB. Free memory was 454.1 MB in the beginning and 479.2 MB in the end (delta: -25.1 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:56,806 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:56,807 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:56,807 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:56,807 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:56,807 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:56,807 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:56,808 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 5]: Procedure Contract for main 2019-05-11 07:11:56,808 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:56,808 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 11]: Loop Invariant 2019-05-11 07:11:56,808 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:56,808 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:56,809 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:11:56,809 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:56,809 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:56,809 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function x + 0 and consists of 5 locations. One deterministic module has affine ranking function y + 0 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. 2019-05-11 07:11:56,810 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:56,810 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 + ~y~2 > 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 + ~y~2 > 0);" "assume !(~x~2 > 0);" "assume !(~y~2 > 0);" "~c~2 := ~c~2 + 1;" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "62#(<= main_~x~2 oldRank0)" }, initialStates = {"52#unseeded" }, finalStates = {"27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("52#unseeded" "call #t~ret2 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "62#(<= main_~x~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !true;" "27#false") ("62#(<= main_~x~2 oldRank0)" "assume !(~x~2 + ~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume true;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !!(~x~2 + ~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !(~x~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !(~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !true;" "27#false") ("62#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("62#(<= main_~x~2 oldRank0)" "#res := 0;assume true;" "62#(<= main_~x~2 oldRank0)") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("27#false" "52#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 + ~y~2 > 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 + ~y~2 > 0);" "assume !(~x~2 > 0);" "assume !(~y~2 > 0);" "~c~2 := ~c~2 + 1;" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"52#unseeded" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "62#(<= main_~x~2 oldRank0)" }, initialStates = {"52#unseeded" }, finalStates = {"27#false" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" }, callTransitions = { ("52#unseeded" "call #t~ret2 := main();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("52#unseeded" "call ULTIMATE.init();" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("27#false" "assume true;" "27#false") ("27#false" "#res := 0;assume true;" "27#false") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume true;" "62#(<= main_~x~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 oldRank0)") ("61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))" "assume !true;" "27#false") ("62#(<= main_~x~2 oldRank0)" "assume !(~x~2 + ~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume true;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !!(~x~2 + ~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !(~x~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !(~y~2 > 0);" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "~c~2 := ~c~2 + 1;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "62#(<= main_~x~2 oldRank0)") ("62#(<= main_~x~2 oldRank0)" "assume !true;" "27#false") ("62#(<= main_~x~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "61#(and (<= 0 oldRank0) (<= (+ main_~x~2 1) oldRank0))") ("62#(<= main_~x~2 oldRank0)" "#res := 0;assume true;" "62#(<= main_~x~2 oldRank0)") }, returnTransitions = { ("55#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "52#unseeded" "return;" "52#unseeded") ("27#false" "52#unseeded" "return;" "27#false") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~x~2 + ~y~2 > 0);" "assume true;" "assume true;" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "assume !true;" "#res := 0;assume true;" "assume true;" "assume !!(~x~2 + ~y~2 > 0);" "assume !(~x~2 > 0);" "assume !(~y~2 > 0);" "~c~2 := ~c~2 + 1;" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"224#(<= main_~y~2 oldRank0)" "213#unseeded" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, initialStates = {"213#unseeded" }, finalStates = {"223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" }, callTransitions = { ("213#unseeded" "call #t~ret2 := main();" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("213#unseeded" "call ULTIMATE.init();" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("224#(<= main_~y~2 oldRank0)" "assume true;" "224#(<= main_~y~2 oldRank0)") ("224#(<= main_~y~2 oldRank0)" "assume !!(~x~2 + ~y~2 > 0);" "224#(<= main_~y~2 oldRank0)") ("224#(<= main_~y~2 oldRank0)" "assume !(~x~2 > 0);" "224#(<= main_~y~2 oldRank0)") ("224#(<= main_~y~2 oldRank0)" "~c~2 := ~c~2 + 1;" "224#(<= main_~y~2 oldRank0)") ("224#(<= main_~y~2 oldRank0)" "assume ~y~2 > 0;~y~2 := ~y~2 - 1;" "223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("224#(<= main_~y~2 oldRank0)" "assume ~x~2 > 0;~x~2 := ~x~2 - 1;" "224#(<= main_~y~2 oldRank0)") ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))") ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~c~2;havoc ~x~2;havoc ~y~2;~x~2 := #t~nondet0;havoc #t~nondet0;~y~2 := #t~nondet1;havoc #t~nondet1;~c~2 := 0;" "216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "assume !!(~x~2 + ~y~2 > 0);" "224#(<= main_~y~2 oldRank0)") ("223#(and (<= 0 oldRank0) (<= (+ main_~y~2 1) oldRank0))" "~c~2 := ~c~2 + 1;" "224#(<= main_~y~2 oldRank0)") }, returnTransitions = { ("216#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "213#unseeded" "return;" "213#unseeded") } ); 2019-05-11 07:11:56,810 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:56,811 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 0.8s and 4 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization removed 2 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 7 SDtfs, 1 SDslu, 10 SDs, 0 lazy, 74 Sat,38 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.0s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital20 mio100 ax100 hnf97 lsp75 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq140 hnf95 smp100 dnf100 smp100 tf110 neg100 sie100 Nontermination: inital20 mio100 ax100 hnf97 lsp75 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq140 hnf95 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:56,811 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:56,811 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:56,811 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:56,811 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:56,818 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.64 ms. Allocated memory is still 514.9 MB. Free memory was 490.2 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 111.31 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.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.51 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.97 ms. Allocated memory is still 514.9 MB. Free memory was 477.3 MB in the beginning and 464.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 53.1 GB * BlockEncoding took 59.38 ms. Allocated memory is still 514.9 MB. Free memory was 464.9 MB in the beginning and 460.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 106.84 ms. Allocated memory is still 514.9 MB. Free memory was 460.9 MB in the beginning and 454.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 920.65 ms. Allocated memory is still 514.9 MB. Free memory was 454.1 MB in the beginning and 479.2 MB in the end (delta: -25.1 MB). There was no memory consumed. Max. memory is 53.1 GB 2019-05-11 07:11:56,845 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully