YES 2019-05-11 07:11:24,504 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:24,507 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:24,511 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:24,511 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:24,512 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:24,512 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:24,513 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:24,513 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:24,513 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:24,516 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:24,516 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:24,516 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:24,517 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:24,517 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:24,517 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:24,518 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:26,183 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:26,184 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:26,184 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:26,184 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:26,531 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:26,532 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:26,532 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:26,532 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:26,532 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:26,533 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:26,533 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:26,533 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:26,533 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:26,533 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:26,534 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:26,534 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:26,534 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:26,534 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:26,534 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:26,535 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:26,535 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:26,535 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:26,535 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:26,535 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:26,535 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:26,536 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:26,536 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:26,536 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:26,536 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:26,536 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:26,537 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:26,537 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:26,537 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:26,537 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:26,537 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:26,537 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:26,538 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:26,538 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:26,538 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:26,759 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:26,765 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:26,766 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:26,768 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:26,770 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:26,770 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:26,770 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:11:26,891 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:26,893 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:26,893 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:26,894 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:26,897 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:26,897 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:26" (1/1) ... 2019-05-11 07:11:27,004 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:27,005 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:27,005 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:27,005 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:27,021 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:27" (1/1) ... 2019-05-11 07:11:27,025 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:27" (1/1) ... 2019-05-11 07:11:27,026 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:27" (1/1) ... 2019-05-11 07:11:27,027 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:27" (1/1) ... 2019-05-11 07:11:27,028 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:27" (1/1) ... 2019-05-11 07:11:27,029 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:27" (1/1) ... 2019-05-11 07:11:27,030 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:27,030 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:27,031 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:27,031 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:27,032 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:27" (1/1) ... 2019-05-11 07:11:27,133 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:27,136 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:27,246 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:27,246 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:27,246 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:27,248 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:27,248 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:27" (1/1) ... 2019-05-11 07:11:27,262 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:27" (1/1) ... 2019-05-11 07:11:27,288 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:27,289 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:27,313 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:27,313 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:27,314 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:27,315 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:27,315 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:27" (1/5) ... 2019-05-11 07:11:27,316 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:26" (2/5) ... 2019-05-11 07:11:27,317 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:27" (3/5) ... 2019-05-11 07:11:27,317 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:27" (4/5) ... 2019-05-11 07:11:27,317 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:27" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:27,412 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:27,413 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:27,413 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:27,413 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:27,416 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:11:27" (1/1) ... 2019-05-11 07:11:28,820 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:28,821 INFO [Benchmark.java:150]: Toolchain (without parser) took 1928.61 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 MB in the beginning and 396.8 MB in the end (delta: 213.4 MB). Peak memory consumption was 213.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:28,823 INFO [Benchmark.java:150]: CDTParser took 110.38 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:28,824 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 111.28 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 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:28,824 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.37 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:28,825 INFO [Benchmark.java:150]: RCFGBuilder took 215.58 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.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:28,826 INFO [Benchmark.java:150]: BlockEncoding took 67.05 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 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:28,827 INFO [Benchmark.java:150]: TraceAbstraction took 99.24 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 578.2 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:28,827 INFO [Benchmark.java:150]: BuchiAutomizer took 1406.89 ms. Allocated memory is still 649.6 MB. Free memory was 578.2 MB in the beginning and 396.8 MB in the end (delta: 181.4 MB). Peak memory consumption was 181.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:28,834 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:28,834 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:28,834 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:28,834 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:28,835 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:28,835 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:28,835 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:28,836 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:28,836 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 20]: Loop Invariant 2019-05-11 07:11:28,836 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:28,836 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:28,836 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:28,837 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:28,837 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:28,837 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i + 0 and consists of 6 locations. One deterministic module has affine ranking function m + -1 * j + 0 and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j + 0 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 2019-05-11 07:11:28,837 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:28,837 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~i~2 < ~n~2);" "assume true;" "assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "#res := 0;assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~i~2 < ~n~2);" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "assume true;" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"81#unseeded" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "55#false" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))" }, initialStates = {"81#unseeded" }, finalStates = {"55#false" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("81#unseeded" "call #t~ret2 := main();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("81#unseeded" "call ULTIMATE.init();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("81#unseeded" "assume true;" "81#unseeded") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#false" "assume true;" "55#false") ("55#false" "assume true;" "55#false") ("55#false" "#res := 0;assume true;" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !(~i~2 < ~n~2);" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !true;" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !!(~i~2 < ~n~2);" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume !true;" "55#false") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !(~i~2 < ~n~2);" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !!(~i~2 < ~n~2);" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "#res := 0;assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") }, returnTransitions = { ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "81#unseeded" "return;" "81#unseeded") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "81#unseeded" "return;" "81#unseeded") ("55#false" "81#unseeded" "return;" "55#false") } ); NestedWordAutomaton buchiAutomatonIteration1 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~i~2 < ~n~2);" "assume true;" "assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "#res := 0;assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~i~2 < ~n~2);" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "assume true;" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"81#unseeded" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "55#false" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))" }, initialStates = {"81#unseeded" }, finalStates = {"55#false" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" }, callTransitions = { ("81#unseeded" "call #t~ret2 := main();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("81#unseeded" "call ULTIMATE.init();" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("81#unseeded" "assume true;" "81#unseeded") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "#res := 0;assume true;" "84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("55#false" "assume true;" "55#false") ("55#false" "assume true;" "55#false") ("55#false" "#res := 0;assume true;" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !(~i~2 < ~n~2);" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !true;" "55#false") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !!(~i~2 < ~n~2);" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume true;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume !true;" "55#false") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("90#(and (<= (+ main_~n~2 1) (+ main_~i~2 oldRank0)) (<= 0 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !(~i~2 < ~n~2);" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !true;" "55#false") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "assume !!(~i~2 < ~n~2);" "104#(and (<= main_~n~2 (+ main_~i~2 oldRank0)) (<= (+ main_~i~2 1) main_~n~2))") ("91#(<= main_~n~2 (+ main_~i~2 oldRank0))" "#res := 0;assume true;" "91#(<= main_~n~2 (+ main_~i~2 oldRank0))") }, returnTransitions = { ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "81#unseeded" "return;" "81#unseeded") ("84#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "81#unseeded" "return;" "81#unseeded") ("55#false" "81#unseeded" "return;" "55#false") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~i~2 < ~n~2);" "assume true;" "assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "#res := 0;assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~i~2 < ~n~2);" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "assume true;" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "242#(<= main_~m~2 (+ main_~j~2 oldRank0))" "231#unseeded" "234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"231#unseeded" }, finalStates = {"241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" }, callTransitions = { ("231#unseeded" "call #t~ret2 := main();" "234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("231#unseeded" "call ULTIMATE.init();" "234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume !!(~i~2 < ~n~2);" "242#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;" "242#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("242#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;" "242#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("242#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume !!(~i~2 < ~n~2);" "242#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("242#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" "241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "241#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") }, returnTransitions = { ("234#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "231#unseeded" "return;" "231#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~i~2 < ~n~2);" "assume true;" "assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~m~2 > 0 && ~n~2 > ~m~2);" "#res := 0;assume true;" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~i~2 < ~n~2);" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "assume true;" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" }, returnAlphabet = {"return;" "return;" }, states = {"585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "586#(<= main_~m~2 (+ main_~j~2 oldRank0))" "572#unseeded" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"572#unseeded" }, finalStates = {"585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" }, callTransitions = { ("572#unseeded" "call #t~ret2 := main();" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("572#unseeded" "call ULTIMATE.init();" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;" "586#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))" "assume true;" "586#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("586#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume true;" "586#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("586#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume !!(~i~2 < ~n~2);" "586#(<= main_~m~2 (+ main_~j~2 oldRank0))") ("586#(<= main_~m~2 (+ main_~j~2 oldRank0))" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" "585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~m~2;havoc ~n~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~m~2 > 0 && ~n~2 > ~m~2;~i~2 := 0;~j~2 := 0;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~i~2 < ~n~2);" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~j~2 < ~m~2);~j~2 := 0;~i~2 := ~i~2 + 1;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "585#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~j~2 oldRank0)))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~j~2 < ~m~2;~j~2 := ~j~2 + 1;" "575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("575#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "572#unseeded" "return;" "572#unseeded") } ); 2019-05-11 07:11:28,838 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:28,839 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.3s and 4 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 24 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 11 SDtfs, 0 SDslu, 6 SDs, 0 lazy, 144 Sat,114 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Termination: inital14 mio100 ax100 hnf122 lsp69 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital14 mio100 ax100 hnf122 lsp69 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:11:28,839 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:28,839 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:28,839 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:28,839 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:28,846 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 110.38 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 111.28 ms. Allocated memory is still 649.6 MB. Free memory was 610.3 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.37 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 215.58 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.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 53.1 GB * BlockEncoding took 67.05 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 585.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 99.24 ms. Allocated memory is still 649.6 MB. Free memory was 585.0 MB in the beginning and 578.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1406.89 ms. Allocated memory is still 649.6 MB. Free memory was 578.2 MB in the beginning and 396.8 MB in the end (delta: 181.4 MB). Peak memory consumption was 181.4 MB. Max. memory is 53.1 GB 2019-05-11 07:11:28,872 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully