./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer --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 64bit --witnessprinter.graph.data.programhash a5e4c58569d8caa47946d30f6cb501096837aef1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:15:56,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:15:56,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:15:56,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:15:56,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:15:56,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:15:56,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:15:56,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:15:56,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:15:56,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:15:56,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:15:56,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:15:56,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:15:56,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:15:56,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:15:56,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:15:56,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:15:56,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:15:56,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:15:56,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:15:56,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:15:56,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:15:56,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:15:56,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:15:56,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:15:56,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:15:56,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:15:56,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:15:56,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:15:56,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:15:56,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:15:56,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:15:56,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:15:56,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:15:56,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:15:56,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:15:56,750 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:15:56,757 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:15:56,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:15:56,758 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:15:56,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:15:56,758 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:15:56,758 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:15:56,758 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:15:56,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:15:56,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:15:56,760 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:15:56,761 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:15:56,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:15:56,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:15:56,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:15:56,761 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:15:56,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:15:56,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:15:56,762 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:15:56,762 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:15:56,762 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2018-11-28 12:15:56,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:15:56,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:15:56,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:15:56,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:15:56,798 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:15:56,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 12:15:56,837 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/data/e23ce87b6/f46cdf921cb243689c147e8bae7c317e/FLAG4c1138649 [2018-11-28 12:15:57,225 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:15:57,225 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 12:15:57,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/data/e23ce87b6/f46cdf921cb243689c147e8bae7c317e/FLAG4c1138649 [2018-11-28 12:15:57,236 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/data/e23ce87b6/f46cdf921cb243689c147e8bae7c317e [2018-11-28 12:15:57,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:15:57,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:15:57,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:15:57,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:15:57,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:15:57,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e525da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57, skipping insertion in model container [2018-11-28 12:15:57,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:15:57,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:15:57,343 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:15:57,345 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:15:57,353 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:15:57,361 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:15:57,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57 WrapperNode [2018-11-28 12:15:57,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:15:57,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:15:57,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:15:57,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:15:57,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:15:57,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:15:57,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:15:57,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:15:57,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... [2018-11-28 12:15:57,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:15:57,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:15:57,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:15:57,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:15:57,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:57,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:15:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:15:57,563 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:15:57,563 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 12:15:57,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:15:57 BoogieIcfgContainer [2018-11-28 12:15:57,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:15:57,564 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:15:57,564 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:15:57,567 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:15:57,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:15:57,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:15:57" (1/3) ... [2018-11-28 12:15:57,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eb43060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:15:57, skipping insertion in model container [2018-11-28 12:15:57,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:15:57,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:15:57" (2/3) ... [2018-11-28 12:15:57,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eb43060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:15:57, skipping insertion in model container [2018-11-28 12:15:57,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:15:57,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:15:57" (3/3) ... [2018-11-28 12:15:57,570 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 12:15:57,606 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:15:57,607 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:15:57,607 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:15:57,607 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:15:57,607 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:15:57,607 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:15:57,607 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:15:57,607 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:15:57,607 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:15:57,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 12:15:57,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:57,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:57,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:57,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:15:57,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:57,634 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:15:57,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 12:15:57,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:57,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:57,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:57,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:15:57,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:57,642 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2018-11-28 12:15:57,642 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2018-11-28 12:15:57,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 12:15:57,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:57,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 12:15:57,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:57,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 12:15:57,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:57,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:57,792 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:57,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:57,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:57,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:57,793 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:57,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:57,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:57,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:57,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 12:15:57,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:57,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:57,815 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 12:15:57,824 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 12:15:57,827 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 12:15:57,837 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 12:15:57,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:57,954 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:57,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:57,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:57,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:57,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:57,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:57,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:57,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:57,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:57,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:57,997 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:58,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:58,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,030 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:58,031 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:58,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 12:15:58,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,033 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 12:15:58,040 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 12:15:58,044 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 12:15:58,056 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 12:15:58,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:58,130 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 12:15:58,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:58,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:58,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:58,141 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 12:15:58,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:58,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:58,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:58,151 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 12:15:58,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:58,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:58,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:58,157 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:58,160 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:58,161 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:15:58,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:58,162 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:58,163 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:58,163 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:15:58,164 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:58,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,198 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 12:15:58,207 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:15:58,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-28 12:15:58,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-28 12:15:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 12:15:58,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 12:15:58,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:15:58,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 12:15:58,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 12:15:58,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:58,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-28 12:15:58,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 12:15:58,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 12:15:58,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 12:15:58,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:58,248 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:15:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 12:15:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 12:15:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:15:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 12:15:58,265 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:15:58,266 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:15:58,266 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:15:58,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 12:15:58,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:58,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:58,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:58,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:15:58,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:58,267 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2018-11-28 12:15:58,267 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2018-11-28 12:15:58,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 12:15:58,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 12:15:58,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-11-28 12:15:58,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,297 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,298 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:58,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:15:58,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,298 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,299 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 12:15:58,301 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 12:15:58,307 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 12:15:58,309 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 12:15:58,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,368 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:58,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:58,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:58,391 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:58,394 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:58,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:58,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,429 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:58,430 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:58,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:15:58,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,432 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 12:15:58,434 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 12:15:58,437 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 12:15:58,440 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 12:15:58,475 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:58,475 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 12:15:58,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:58,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:58,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:58,481 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 12:15:58,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:58,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:58,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:58,485 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:58,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:58,487 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:15:58,488 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:58,488 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:58,488 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:58,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 12:15:58,488 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:58,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,538 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 12:15:58,538 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 12:15:58,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 12:15:58,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-28 12:15:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:15:58,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:15:58,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:15:58,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 12:15:58,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-28 12:15:58,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:58,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 12:15:58,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 12:15:58,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:15:58,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 12:15:58,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:58,559 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:15:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 12:15:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 12:15:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:15:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 12:15:58,560 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:15:58,560 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:15:58,561 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:15:58,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 12:15:58,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:15:58,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:58,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:58,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 12:15:58,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:58,562 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2018-11-28 12:15:58,562 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2018-11-28 12:15:58,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-11-28 12:15:58,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:58,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 12:15:58,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-11-28 12:15:58,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:58,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,610 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:58,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:15:58,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,611 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 12:15:58,615 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 12:15:58,617 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 12:15:58,621 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 12:15:58,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,663 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/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 12:15:58,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:58,665 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:58,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,706 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:58,708 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:58,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:15:58,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,710 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 12:15:58,713 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 12:15:58,718 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 12:15:58,720 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 12:15:58,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,761 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:58,761 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 12:15:58,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:58,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:58,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:58,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:58,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:58,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:58,766 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:58,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:58,770 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:15:58,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:58,770 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:58,770 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:58,770 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:15:58,771 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,797 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 12:15:58,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:15:58,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 12:15:58,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 12:15:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:15:58,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:15:58,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,806 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:58,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,824 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 12:15:58,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:15:58,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 12:15:58,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 12:15:58,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:15:58,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:15:58,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,836 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:58,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:58,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:58,852 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 12:15:58,852 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 1 loop predicates [2018-11-28 12:15:58,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 12:15:58,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2018-11-28 12:15:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 12:15:58,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:15:58,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:15:58,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 12:15:58,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:58,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-11-28 12:15:58,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:15:58,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-11-28 12:15:58,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 12:15:58,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:15:58,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 12:15:58,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:58,864 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 12:15:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 12:15:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-11-28 12:15:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:15:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-28 12:15:58,865 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 12:15:58,865 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 12:15:58,865 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:15:58,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-11-28 12:15:58,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:15:58,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:58,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:58,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:15:58,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:58,866 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2018-11-28 12:15:58,866 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2018-11-28 12:15:58,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 12:15:58,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-11-28 12:15:58,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:58,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-28 12:15:58,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:58,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:58,890 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:58,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:58,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:58,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:58,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:58,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:58,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:58,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 12:15:58,891 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:58,891 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:58,893 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 12:15:58,895 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 12:15:58,899 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 12:15:58,901 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 12:15:58,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:58,941 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:58,956 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,971 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:58,971 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:58,974 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:58,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:58,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:58,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:58,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:59,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,031 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:59,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,063 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:59,064 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:59,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:59,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:59,064 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:59,064 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:59,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:59,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:59,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 12:15:59,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:59,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:59,065 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 12:15:59,075 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 12:15:59,076 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 12:15:59,078 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 12:15:59,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:59,103 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:59,104 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 12:15:59,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:59,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:59,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:59,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:59,107 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 12:15:59,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:59,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:59,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:59,111 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 12:15:59,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:59,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:59,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:59,115 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 12:15:59,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:59,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:59,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:59,118 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:59,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:59,123 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:15:59,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:59,123 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:59,123 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:59,123 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-28 12:15:59,124 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:59,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,136 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 12:15:59,137 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:15:59,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 12:15:59,141 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2018-11-28 12:15:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-11-28 12:15:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 12:15:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:15:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 12:15:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-11-28 12:15:59,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:15:59,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-11-28 12:15:59,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 12:15:59,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 12:15:59,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-11-28 12:15:59,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:59,143 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-28 12:15:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-11-28 12:15:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 12:15:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:15:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-11-28 12:15:59,144 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 12:15:59,144 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 12:15:59,144 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:15:59,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-11-28 12:15:59,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:15:59,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:59,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:59,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-11-28 12:15:59,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:15:59,146 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-11-28 12:15:59,146 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-11-28 12:15:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-11-28 12:15:59,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:15:59,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:15:59,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:15:59,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:15:59,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-11-28 12:15:59,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:59,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,194 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:59,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:59,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:59,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:59,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:59,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:59,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:59,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 12:15:59,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:59,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:59,196 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 12:15:59,199 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 12:15:59,202 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 12:15:59,204 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 12:15:59,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:59,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,241 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:59,258 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:59,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}] Lambdas: [3, 12, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,301 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:59,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,343 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:59,345 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:59,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:59,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:59,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:59,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:59,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:59,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:59,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 12:15:59,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:59,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:59,348 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 12:15:59,351 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 12:15:59,353 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 12:15:59,356 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 12:15:59,404 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:59,404 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:59,404 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 12:15:59,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:59,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:59,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:59,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:59,409 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 12:15:59,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:15:59,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:15:59,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:15:59,413 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 12:15:59,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:59,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:59,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:59,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:59,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:59,418 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:15:59,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:59,418 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:59,418 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:59,418 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-28 12:15:59,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:59,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,452 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 12:15:59,452 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 12:15:59,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:15:59,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2018-11-28 12:15:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 12:15:59,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 12:15:59,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,458 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,477 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 12:15:59,477 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 12:15:59,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:15:59,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-11-28 12:15:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:15:59,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 12:15:59,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,503 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,533 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 12:15:59,533 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 12:15:59,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:15:59,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-11-28 12:15:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:15:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 12:15:59,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 12:15:59,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 12:15:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 12:15:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 12:15:59,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 12:15:59,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-11-28 12:15:59,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 12:15:59,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 12:15:59,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 12:15:59,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:59,542 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 12:15:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 12:15:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-11-28 12:15:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:15:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 12:15:59,543 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:15:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:15:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:15:59,546 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-11-28 12:15:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:15:59,557 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-28 12:15:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:15:59,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-28 12:15:59,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:15:59,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-11-28 12:15:59,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 12:15:59,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 12:15:59,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 12:15:59,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:15:59,558 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 12:15:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 12:15:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-11-28 12:15:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:15:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 12:15:59,559 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 12:15:59,559 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 12:15:59,559 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:15:59,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-28 12:15:59,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:15:59,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:15:59,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:15:59,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-11-28 12:15:59,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 12:15:59,560 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-11-28 12:15:59,560 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-11-28 12:15:59,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-11-28 12:15:59,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:59,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:59,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:59,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-11-28 12:15:59,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:15:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-11-28 12:15:59,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:15:59,608 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:59,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:59,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:59,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:59,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:15:59,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:59,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:59,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 12:15:59,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:59,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:59,609 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 12:15:59,610 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 12:15:59,615 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 12:15:59,619 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 12:15:59,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:59,647 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:59,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,681 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:15:59,681 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:15:59,685 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:15:59,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:15:59,703 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:15:59,723 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:15:59,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:15:59,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:15:59,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:15:59,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:15:59,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:15:59,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:15:59,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:15:59,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 12:15:59,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:15:59,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:15:59,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 12:15:59,729 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 12:15:59,730 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 12:15:59,732 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 12:15:59,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:15:59,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:15:59,758 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 12:15:59,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:15:59,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:15:59,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:15:59,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:15:59,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:15:59,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:15:59,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:15:59,761 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:15:59,762 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:15:59,762 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:15:59,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:15:59,763 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:15:59,763 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:15:59,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2018-11-28 12:15:59,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:15:59,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,809 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 12:15:59,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:15:59,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:15:59,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2018-11-28 12:15:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:15:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 12:15:59,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:15:59,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,814 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,842 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 12:15:59,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:15:59,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:15:59,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2018-11-28 12:15:59,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:15:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:15:59,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:15:59,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,860 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,897 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 12:15:59,897 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 3 loop predicates [2018-11-28 12:15:59,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:15:59,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2018-11-28 12:15:59,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:15:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 12:15:59,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:15:59,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,904 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,935 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 12:15:59,935 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:15:59,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:15:59,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2018-11-28 12:15:59,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:15:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:15:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 12:15:59,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:15:59,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:15:59,947 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:15:59,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:59,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:15:59,980 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 12:15:59,980 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:15:59,981 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:16:00,019 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2018-11-28 12:16:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:16:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 12:16:00,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:16:00,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 12:16:00,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 12:16:00,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-11-28 12:16:00,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 12:16:00,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-11-28 12:16:00,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 12:16:00,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 12:16:00,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-11-28 12:16:00,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,029 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-11-28 12:16:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-11-28 12:16:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-11-28 12:16:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:16:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-11-28 12:16:00,032 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 12:16:00,032 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 12:16:00,032 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:16:00,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-11-28 12:16:00,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:16:00,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:00,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:00,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-11-28 12:16:00,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 12:16:00,033 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-11-28 12:16:00,033 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-11-28 12:16:00,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-11-28 12:16:00,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:00,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:00,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:16:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 12:16:00,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-28 12:16:00,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:16:00,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:00,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 12:16:00,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:16:00,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-11-28 12:16:00,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:00,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:00,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:00,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:00,155 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:16:00,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:00,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:00,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 12:16:00,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:00,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:00,156 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 12:16:00,162 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 12:16:00,164 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 12:16:00,167 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 12:16:00,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:00,199 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:00,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:00,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:16:00,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:00,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:00,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:16:00,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:00,249 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:16:00,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:00,304 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:16:00,305 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:00,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:00,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:00,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:00,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:16:00,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:00,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:00,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 12:16:00,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:00,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:00,306 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 12:16:00,308 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 12:16:00,309 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 12:16:00,312 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 12:16:00,336 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:00,336 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:16:00,336 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 12:16:00,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:00,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:00,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:00,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:00,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:16:00,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:16:00,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:16:00,339 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 12:16:00,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:00,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:00,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:00,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:00,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:16:00,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:16:00,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:16:00,342 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 12:16:00,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:00,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:16:00,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:00,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:00,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:00,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:16:00,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:16:00,345 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:16:00,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:16:00,346 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:16:00,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:16:00,347 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:16:00,347 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:16:00,347 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 12:16:00,347 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:16:00,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:16:00,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:16:00,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 12:16:00,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2018-11-28 12:16:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:16:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 12:16:00,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 12:16:00,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 12:16:00,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 12:16:00,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2018-11-28 12:16:00,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:16:00,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2018-11-28 12:16:00,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 12:16:00,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 12:16:00,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2018-11-28 12:16:00,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,399 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2018-11-28 12:16:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2018-11-28 12:16:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-11-28 12:16:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 12:16:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-11-28 12:16:00,402 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-11-28 12:16:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:16:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:16:00,402 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2018-11-28 12:16:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:00,410 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-28 12:16:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:16:00,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-28 12:16:00,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:16:00,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2018-11-28 12:16:00,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 12:16:00,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 12:16:00,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-28 12:16:00,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,412 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 12:16:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-28 12:16:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-11-28 12:16:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 12:16:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 12:16:00,413 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 12:16:00,413 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 12:16:00,414 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:16:00,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 12:16:00,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:16:00,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:00,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:00,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-11-28 12:16:00,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 12:16:00,416 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-11-28 12:16:00,416 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-11-28 12:16:00,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-11-28 12:16:00,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-11-28 12:16:00,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-11-28 12:16:00,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:00,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:00,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:16:00,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 12:16:00,515 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:00,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:00,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:00,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:00,516 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:16:00,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:00,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:00,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 12:16:00,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:00,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:00,516 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 12:16:00,518 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 12:16:00,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 12:16:00,528 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 12:16:00,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:00,552 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:00,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:00,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:16:00,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:00,571 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:16:00,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:00,591 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:16:00,604 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:00,604 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:00,604 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:00,604 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:00,605 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:16:00,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:00,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:00,605 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 12:16:00,605 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:00,605 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:00,605 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 12:16:00,607 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 12:16:00,611 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 12:16:00,613 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 12:16:00,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:00,636 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:16:00,636 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 12:16:00,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:00,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:00,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:00,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:00,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:16:00,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:16:00,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:16:00,640 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 12:16:00,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:00,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:16:00,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:00,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:00,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:00,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:16:00,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:16:00,642 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:16:00,643 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:16:00,643 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:16:00,643 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:16:00,643 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:16:00,643 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:16:00,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:16:00,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:16:00,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:00,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 12:16:00,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 12:16:00,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-11-28 12:16:00,697 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 12:16:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:16:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 12:16:00,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 12:16:00,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,698 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:00,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:00,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 12:16:00,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 12:16:00,751 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-11-28 12:16:00,751 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 12:16:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:16:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 12:16:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 12:16:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,752 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:00,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:00,796 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 4 loop predicates [2018-11-28 12:16:00,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 12:16:00,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2018-11-28 12:16:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:16:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 12:16:00,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 12:16:00,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-28 12:16:00,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-11-28 12:16:00,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:00,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-11-28 12:16:00,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-28 12:16:00,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-11-28 12:16:00,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 12:16:00,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 12:16:00,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-11-28 12:16:00,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,833 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-28 12:16:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-11-28 12:16:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-11-28 12:16:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:16:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-11-28 12:16:00,837 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-11-28 12:16:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:16:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:16:00,837 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-11-28 12:16:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:00,852 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-11-28 12:16:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:16:00,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-11-28 12:16:00,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 12:16:00,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-11-28 12:16:00,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 12:16:00,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 12:16:00,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-11-28 12:16:00,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,854 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-11-28 12:16:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-11-28 12:16:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-11-28 12:16:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 12:16:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-11-28 12:16:00,859 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 12:16:00,859 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 12:16:00,859 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:16:00,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-11-28 12:16:00,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 12:16:00,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:00,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:00,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 12:16:00,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-11-28 12:16:00,860 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1623#L12-2 assume !!(main_~c~0 > 0); 1637#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1632#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-11-28 12:16:00,860 INFO L796 eck$LassoCheckResult]: Loop: 1629#L12-2 assume !!(main_~c~0 > 0); 1626#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1627#L12-2 assume !!(main_~c~0 > 0); 1631#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1617#L12-2 assume !!(main_~c~0 > 0); 1618#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1624#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-11-28 12:16:00,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-11-28 12:16:00,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-11-28 12:16:00,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:00,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:00,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:16:00,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:16:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:16:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:16:00,883 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 12:16:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:00,896 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-28 12:16:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:16:00,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-11-28 12:16:00,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:16:00,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-11-28 12:16:00,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:16:00,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:16:00,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-28 12:16:00,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:00,900 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-28 12:16:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-28 12:16:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-28 12:16:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 12:16:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-28 12:16:00,902 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 12:16:00,902 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 12:16:00,902 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:16:00,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-11-28 12:16:00,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:16:00,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:00,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:00,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 12:16:00,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-11-28 12:16:00,907 INFO L794 eck$LassoCheckResult]: Stem: 1712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1714#L12-2 assume !!(main_~c~0 > 0); 1728#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1723#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-11-28 12:16:00,908 INFO L796 eck$LassoCheckResult]: Loop: 1708#L12-2 assume !!(main_~c~0 > 0); 1709#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1718#L12-2 assume !!(main_~c~0 > 0); 1724#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1722#L12-2 assume !!(main_~c~0 > 0); 1715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1716#L12-2 assume !!(main_~c~0 > 0); 1727#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1725#L12-2 assume !!(main_~c~0 > 0); 1721#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-11-28 12:16:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-11-28 12:16:00,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-11-28 12:16:00,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-11-28 12:16:00,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:00,997 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:00,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:00,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:00,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:00,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:16:00,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:00,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:00,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:00,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 12:16:00,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:00,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:00,998 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 12:16:01,000 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 12:16:01,005 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 12:16:01,007 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 12:16:01,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:01,031 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:01,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:01,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:16:01,054 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:01,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:16:01,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:01,093 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:16:01,095 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:01,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:01,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:01,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:01,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:16:01,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:01,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:01,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 12:16:01,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:01,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:01,096 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 12:16:01,098 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 12:16:01,103 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 12:16:01,104 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 12:16:01,135 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:01,135 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:16:01,136 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 12:16:01,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:01,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:01,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:01,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:01,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:16:01,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:16:01,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:16:01,139 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 12:16:01,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:01,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:16:01,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:01,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:01,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:01,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:16:01,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:16:01,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:16:01,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:16:01,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:16:01,151 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:16:01,151 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:16:01,152 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:16:01,152 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:16:01,152 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:16:01,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:16:01,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 12:16:01,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-11-28 12:16:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:16:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:01,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:16:01,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,218 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:16:01,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 12:16:01,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-11-28 12:16:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:16:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:01,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:16:01,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,267 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,311 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 5 loop predicates [2018-11-28 12:16:01,311 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 12:16:01,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2018-11-28 12:16:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:16:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 12:16:01,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:16:01,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,318 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,365 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:16:01,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 12:16:01,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2018-11-28 12:16:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:16:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 12:16:01,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:16:01,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,391 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,439 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:16:01,439 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 12:16:01,478 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,479 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,479 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,479 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,480 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,503 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,503 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,503 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,504 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,504 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,504 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,504 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,504 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:01,515 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2018-11-28 12:16:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:16:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-28 12:16:01,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:16:01,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-28 12:16:01,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-28 12:16:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-11-28 12:16:01,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 12:16:01,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-11-28 12:16:01,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 12:16:01,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:16:01,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-11-28 12:16:01,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:01,526 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-11-28 12:16:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-11-28 12:16:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-11-28 12:16:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 12:16:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-11-28 12:16:01,536 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 12:16:01,536 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 12:16:01,536 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:16:01,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-11-28 12:16:01,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-28 12:16:01,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:01,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:01,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 12:16:01,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-11-28 12:16:01,537 INFO L794 eck$LassoCheckResult]: Stem: 2705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2708#L12-2 assume !!(main_~c~0 > 0); 2733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2725#L12-2 assume !!(main_~c~0 > 0); 2713#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-11-28 12:16:01,537 INFO L796 eck$LassoCheckResult]: Loop: 2701#L12-2 assume !!(main_~c~0 > 0); 2702#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2762#L12-2 assume !!(main_~c~0 > 0); 2756#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2754#L12-2 assume !!(main_~c~0 > 0); 2748#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2747#L12-2 assume !!(main_~c~0 > 0); 2746#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2738#L12-2 assume !!(main_~c~0 > 0); 2717#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2730#L12-2 assume !!(main_~c~0 > 0); 2728#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2727#L12-2 assume !!(main_~c~0 > 0); 2715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-11-28 12:16:01,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-11-28 12:16:01,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:01,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-11-28 12:16:01,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:01,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-11-28 12:16:01,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:01,622 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:01,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:01,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:01,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:01,623 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:16:01,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:01,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:01,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-28 12:16:01,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:01,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:01,624 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 12:16:01,629 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 12:16:01,632 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 12:16:01,633 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 12:16:01,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:01,655 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:01,657 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:16:01,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:01,680 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:16:01,693 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:01,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:01,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:01,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:01,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:16:01,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:01,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:01,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:01,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-28 12:16:01,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:01,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:01,694 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 12:16:01,701 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 12:16:01,703 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 12:16:01,705 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 12:16:01,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:01,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:16:01,725 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 12:16:01,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:01,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:16:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:01,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:16:01,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:16:01,727 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:16:01,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:16:01,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:16:01,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:16:01,729 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:16:01,729 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:16:01,729 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:16:01,730 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:16:01,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 12:16:01,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 12:16:01,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-11-28 12:16:01,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:16:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 12:16:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,786 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 12:16:01,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 12:16:01,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-11-28 12:16:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:16:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:01,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 12:16:01,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,877 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,931 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 7 loop predicates [2018-11-28 12:16:01,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 12:16:01,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2018-11-28 12:16:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:16:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 12:16:01,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 12:16:01,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:01,938 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:01,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:01,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:01,985 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 12:16:01,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 12:16:02,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2018-11-28 12:16:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:16:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 12:16:02,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 12:16:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,011 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:02,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:02,072 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 12:16:02,072 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 12:16:02,106 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,106 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,106 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,107 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,107 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,107 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,107 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,107 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,109 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,109 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,110 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,110 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,133 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,133 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,133 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,134 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,135 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,136 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,137 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,138 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,138 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,138 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,140 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,140 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,140 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,140 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,167 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,171 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 12:16:02,205 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2018-11-28 12:16:02,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:16:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-11-28 12:16:02,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 12:16:02,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-11-28 12:16:02,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-11-28 12:16:02,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-11-28 12:16:02,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-28 12:16:02,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-11-28 12:16:02,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 12:16:02,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 12:16:02,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-11-28 12:16:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:16:02,222 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-11-28 12:16:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-11-28 12:16:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-11-28 12:16:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:16:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-11-28 12:16:02,233 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 12:16:02,233 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 12:16:02,233 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 12:16:02,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-11-28 12:16:02,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 12:16:02,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:16:02,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:16:02,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 12:16:02,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-11-28 12:16:02,235 INFO L794 eck$LassoCheckResult]: Stem: 5618#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5623#L12-2 assume !!(main_~c~0 > 0); 5681#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5633#L12-2 assume !!(main_~c~0 > 0); 5630#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-11-28 12:16:02,235 INFO L796 eck$LassoCheckResult]: Loop: 5614#L12-2 assume !!(main_~c~0 > 0); 5615#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5831#L12-2 assume !!(main_~c~0 > 0); 5761#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5759#L12-2 assume !!(main_~c~0 > 0); 5757#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5755#L12-2 assume !!(main_~c~0 > 0); 5751#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5752#L12-2 assume !!(main_~c~0 > 0); 5734#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5735#L12-2 assume !!(main_~c~0 > 0); 5731#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5732#L12-2 assume !!(main_~c~0 > 0); 5635#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5657#L12-2 assume !!(main_~c~0 > 0); 5636#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5634#L12-2 assume !!(main_~c~0 > 0); 5632#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-11-28 12:16:02,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-11-28 12:16:02,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:02,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-11-28 12:16:02,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-11-28 12:16:02,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:02,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:16:02,374 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-11-28 12:16:02,382 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:02,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:02,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:02,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:02,382 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:16:02,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:02,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:02,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:02,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 12:16:02,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:02,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:02,383 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 12:16:02,390 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 12:16:02,392 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 12:16:02,393 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 12:16:02,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:02,421 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:02,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:16:02,428 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3231f4b2-b25f-4a99-91f7-1572d6f37374/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:02,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:16:02,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:16:02,489 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:16:02,490 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:16:02,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:16:02,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:16:02,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:16:02,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:16:02,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:16:02,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:16:02,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:16:02,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 12:16:02,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:16:02,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:16:02,491 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 12:16:02,498 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 12:16:02,500 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 12:16:02,502 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 12:16:02,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:16:02,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:16:02,529 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 12:16:02,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:16:02,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:16:02,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:16:02,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:16:02,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:16:02,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:16:02,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:16:02,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:16:02,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:16:02,532 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:16:02,532 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:16:02,532 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:16:02,533 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:16:02,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 12:16:02,533 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:16:02,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 12:16:02,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 12:16:02,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 12:16:02,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-11-28 12:16:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:16:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:02,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 12:16:02,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,586 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:02,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 12:16:02,654 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 12:16:02,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 12:16:02,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-11-28 12:16:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:16:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 12:16:02,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 12:16:02,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,664 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:02,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 12:16:02,730 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 6 loop predicates [2018-11-28 12:16:02,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 12:16:02,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2018-11-28 12:16:02,750 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 12:16:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:16:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 12:16:02,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 12:16:02,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,751 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:16:02,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:02,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 12:16:02,863 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 12:16:02,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 12:16:02,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2018-11-28 12:16:02,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:16:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:16:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-28 12:16:02,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 12:16:02,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-28 12:16:02,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-28 12:16:02,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:16:02,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2018-11-28 12:16:02,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:16:02,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2018-11-28 12:16:02,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:16:02,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:16:02,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:16:02,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:16:02,900 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:16:02,900 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:16:02,900 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:16:02,900 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 12:16:02,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:16:02,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:16:02,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:16:02,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:16:02 BoogieIcfgContainer [2018-11-28 12:16:02,906 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:16:02,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:16:02,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:16:02,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:16:02,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:15:57" (3/4) ... [2018-11-28 12:16:02,910 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:16:02,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:16:02,912 INFO L168 Benchmark]: Toolchain (without parser) took 5673.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 959.8 MB in the beginning and 896.6 MB in the end (delta: 63.1 MB). Peak memory consumption was 398.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:02,912 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:16:02,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 950.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:02,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.32 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:16:02,913 INFO L168 Benchmark]: Boogie Preprocessor took 11.87 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:16:02,913 INFO L168 Benchmark]: RCFGBuilder took 170.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:02,914 INFO L168 Benchmark]: BuchiAutomizer took 5342.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 896.6 MB in the end (delta: 238.0 MB). Peak memory consumption was 422.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:02,914 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.4 GB. Free memory is still 896.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:16:02,916 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 122.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 950.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.32 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.87 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5342.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 896.6 MB in the end (delta: 238.0 MB). Peak memory consumption was 422.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.4 GB. Free memory is still 896.6 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 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 335 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 159 SDtfs, 158 SDslu, 75 SDs, 0 SdLazy, 277 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...