./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a881e1073186594f4727f809fbe5d917ff145543 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:44:34,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:44:34,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:44:34,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:44:34,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:44:34,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:44:34,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:44:34,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:44:34,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:44:34,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:44:34,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:44:34,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:44:34,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:44:34,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:44:34,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:44:34,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:44:34,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:44:34,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:44:34,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:44:34,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:44:34,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:44:34,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:44:34,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:44:34,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:44:34,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:44:34,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:44:34,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:44:34,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:44:34,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:44:34,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:44:34,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:44:34,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:44:34,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:44:34,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:44:34,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:44:34,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:44:34,351 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:44:34,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:44:34,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:44:34,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:44:34,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:44:34,370 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:44:34,370 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:44:34,370 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:44:34,370 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:44:34,370 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:44:34,371 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:44:34,371 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:44:34,371 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:44:34,371 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:44:34,371 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:44:34,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:44:34,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:44:34,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:44:34,373 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:44:34,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:44:34,373 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:44:34,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:44:34,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:44:34,374 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:44:34,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:44:34,374 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:44:34,374 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:44:34,375 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:44:34,375 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a881e1073186594f4727f809fbe5d917ff145543 [2018-11-28 23:44:34,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:44:34,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:44:34,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:44:34,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:44:34,436 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:44:34,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2018-11-28 23:44:34,501 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddebbb1a0/355329b11d3143d09748cfc052f428ff/FLAGf11f80b34 [2018-11-28 23:44:34,971 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:44:34,972 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2018-11-28 23:44:34,977 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddebbb1a0/355329b11d3143d09748cfc052f428ff/FLAGf11f80b34 [2018-11-28 23:44:35,325 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddebbb1a0/355329b11d3143d09748cfc052f428ff [2018-11-28 23:44:35,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:44:35,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:44:35,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:35,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:44:35,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:44:35,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb0eb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35, skipping insertion in model container [2018-11-28 23:44:35,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:44:35,369 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:44:35,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:35,554 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:44:35,577 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:35,597 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:44:35,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35 WrapperNode [2018-11-28 23:44:35,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:35,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:35,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:44:35,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:44:35,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:35,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:44:35,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:44:35,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:44:35,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... [2018-11-28 23:44:35,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:44:35,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:44:35,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:44:35,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:44:35,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:44:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:44:36,135 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:44:36,136 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:44:36,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:36 BoogieIcfgContainer [2018-11-28 23:44:36,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:44:36,137 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:44:36,137 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:44:36,143 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:44:36,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:36,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:44:35" (1/3) ... [2018-11-28 23:44:36,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfa7199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:36, skipping insertion in model container [2018-11-28 23:44:36,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:36,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:35" (2/3) ... [2018-11-28 23:44:36,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfa7199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:36, skipping insertion in model container [2018-11-28 23:44:36,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:36,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:36" (3/3) ... [2018-11-28 23:44:36,150 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2018-11-28 23:44:36,219 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:44:36,220 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:44:36,220 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:44:36,220 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:44:36,221 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:44:36,221 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:44:36,221 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:44:36,221 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:44:36,221 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:44:36,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:44:36,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:36,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:36,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:36,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:44:36,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:36,271 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:44:36,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:44:36,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:36,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:36,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:36,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:44:36,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:36,285 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 3#L15true assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 7#L16true assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 15#L17-3true [2018-11-28 23:44:36,286 INFO L796 eck$LassoCheckResult]: Loop: 15#L17-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 4#L18-3true assume !(main_~j~0 < main_~m~0); 5#L17-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 15#L17-3true [2018-11-28 23:44:36,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2018-11-28 23:44:36,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:36,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 48858, now seen corresponding path program 1 times [2018-11-28 23:44:36,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:36,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 922020726, now seen corresponding path program 1 times [2018-11-28 23:44:36,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:36,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:36,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:44:36,660 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:36,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:36,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:36,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:36,661 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:36,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:36,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:36,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:36,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration1_Loop [2018-11-28 23:44:36,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:36,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:36,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:36,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:36,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:36,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:36,876 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:36,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:36,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:36,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:36,895 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:36,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:36,919 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:36,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:36,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:37,062 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:37,064 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:37,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:37,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:37,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:37,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:37,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:37,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:37,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:37,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration1_Loop [2018-11-28 23:44:37,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:37,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:37,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:37,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:37,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:37,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:37,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:37,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:37,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:37,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:37,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:37,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:37,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:37,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:37,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:37,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:37,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:37,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:37,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:37,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:37,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:37,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:37,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:37,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:37,479 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:37,489 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:37,490 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:37,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:37,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:37,492 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:37,493 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:44:37,495 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:37,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:37,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:37,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:37,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:37,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-28 23:44:37,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 40 states and 55 transitions. Complement of second has 7 states. [2018-11-28 23:44:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-28 23:44:37,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:44:37,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:37,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:44:37,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:37,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:44:37,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:37,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2018-11-28 23:44:37,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:44:37,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 14 transitions. [2018-11-28 23:44:37,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:44:37,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:44:37,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 23:44:37,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:37,740 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:44:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 23:44:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:44:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:44:37,770 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:44:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:44:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:44:37,774 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2018-11-28 23:44:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:37,911 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 23:44:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:44:37,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 23:44:37,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:44:37,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 23:44:37,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:44:37,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:44:37,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 23:44:37,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:37,915 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:44:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 23:44:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-11-28 23:44:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:44:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 23:44:37,918 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:44:37,918 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:44:37,918 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:44:37,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 23:44:37,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:44:37,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:37,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:37,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:44:37,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:44:37,920 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 127#L15 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 128#L16 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 136#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 129#L18-3 [2018-11-28 23:44:37,920 INFO L796 eck$LassoCheckResult]: Loop: 129#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 130#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 129#L18-3 [2018-11-28 23:44:37,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 959438, now seen corresponding path program 1 times [2018-11-28 23:44:37,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:37,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2018-11-28 23:44:37,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash 922020784, now seen corresponding path program 1 times [2018-11-28 23:44:37,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:38,031 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:38,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:38,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:38,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:38,032 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:38,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:38,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:38,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 23:44:38,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:38,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:38,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:38,129 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:38,134 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:38,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:38,296 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:38,298 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:38,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:38,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:38,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:38,298 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:38,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:38,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:38,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 23:44:38,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:38,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:38,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:38,472 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:38,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:38,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:38,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:38,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:38,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:38,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:38,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:38,483 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:38,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:38,490 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:38,490 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:38,491 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:38,491 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:38,491 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:38,491 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:38,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:38,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:38,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:38,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:38,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:44:38,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 7 states. [2018-11-28 23:44:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:44:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:44:38,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:44:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:44:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:38,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 23:44:38,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:44:38,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 20 transitions. [2018-11-28 23:44:38,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:44:38,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:44:38,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 23:44:38,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:38,946 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:44:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 23:44:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-11-28 23:44:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:44:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 23:44:38,948 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:44:38,948 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:44:38,948 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:44:38,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-28 23:44:38,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:44:38,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:38,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:38,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:38,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:44:38,950 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 209#L15 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 210#L16 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 213#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 207#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 208#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 211#L18-3 assume !(main_~j~0 < main_~m~0); 203#L17-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 204#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 205#L18-3 [2018-11-28 23:44:38,950 INFO L796 eck$LassoCheckResult]: Loop: 205#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 206#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 205#L18-3 [2018-11-28 23:44:38,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1605343291, now seen corresponding path program 1 times [2018-11-28 23:44:38,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:38,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:38,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:38,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:38,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 23:44:39,162 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:44:39,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2018-11-28 23:44:39,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:39,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:39,230 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:39,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:39,230 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:39,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:39,231 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:39,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:39,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:39,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:39,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:39,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:39,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:39,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:39,347 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:39,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:39,356 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:39,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:39,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:39,520 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:39,522 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:39,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:39,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:39,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:39,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:39,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:39,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:39,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:39,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:39,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:39,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:39,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:39,606 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:39,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:39,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:39,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:39,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:39,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:39,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:39,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:39,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:39,614 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:39,619 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:39,620 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:39,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:39,620 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:39,621 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:39,621 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:39,621 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:39,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:39,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:39,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:44:39,818 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 7 states. [2018-11-28 23:44:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:44:39,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:44:39,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:39,820 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:39,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:39,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:39,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:44:39,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 7 states. [2018-11-28 23:44:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:44:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:44:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:39,958 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:40,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:40,057 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:40,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:44:40,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 6 states. [2018-11-28 23:44:40,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 23:44:40,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:44:40,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:44:40,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:44:40,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 23:44:40,087 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:40,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-28 23:44:40,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:40,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:40,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:40,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:40,087 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:40,089 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:40,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:44:40,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:44:40,089 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2018-11-28 23:44:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:40,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:44:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:44:40,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:44:40,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:40,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:44:40,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:40,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:40,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:40,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:40,091 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:40,091 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:40,091 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:40,091 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:44:40,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:44:40,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:40,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:44:40,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:44:40 BoogieIcfgContainer [2018-11-28 23:44:40,099 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:44:40,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:44:40,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:44:40,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:44:40,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:36" (3/4) ... [2018-11-28 23:44:40,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:44:40,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:44:40,107 INFO L168 Benchmark]: Toolchain (without parser) took 4777.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 954.0 MB in the beginning and 914.5 MB in the end (delta: 39.5 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:40,109 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:40,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:40,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.65 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:40,111 INFO L168 Benchmark]: Boogie Preprocessor took 31.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:40,112 INFO L168 Benchmark]: RCFGBuilder took 460.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:40,113 INFO L168 Benchmark]: BuchiAutomizer took 3962.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 914.5 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:40,114 INFO L168 Benchmark]: Witness Printer took 6.32 ms. Allocated memory is still 1.1 GB. Free memory is still 914.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:40,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.65 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3962.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 914.5 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.32 ms. Allocated memory is still 1.1 GB. Free memory is still 914.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 50 SDslu, 25 SDs, 0 SdLazy, 46 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf98 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...