./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-635dfa2 [2018-12-09 00:13:23,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:13:23,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:13:23,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:13:23,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:13:23,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:13:23,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:13:23,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:13:23,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:13:23,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:13:23,875 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:13:23,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:13:23,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:13:23,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:13:23,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:13:23,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:13:23,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:13:23,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:13:23,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:13:23,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:13:23,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:13:23,881 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:13:23,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:13:23,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:13:23,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:13:23,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:13:23,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:13:23,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:13:23,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:13:23,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:13:23,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:13:23,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:13:23,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:13:23,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:13:23,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:13:23,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:13:23,886 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 00:13:23,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:13:23,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:13:23,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:13:23,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:13:23,895 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:13:23,895 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:13:23,895 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:13:23,895 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:13:23,895 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:13:23,896 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:13:23,896 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:13:23,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:13:23,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:13:23,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:13:23,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:13:23,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:13:23,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:13:23,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:13:23,898 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:13:23,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:13:23,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:13:23,898 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:13:23,899 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:13:23,899 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:23,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:13:23,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:13:23,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:13:23,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:13:23,931 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:13:23,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-12-09 00:13:23,966 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/data/3b8523a3e/c857725abf6742879ac2c9348d4ff6ce/FLAGb1ebc26cb [2018-12-09 00:13:24,304 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:13:24,304 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-12-09 00:13:24,308 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/data/3b8523a3e/c857725abf6742879ac2c9348d4ff6ce/FLAGb1ebc26cb [2018-12-09 00:13:24,317 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/bin-2019/uautomizer/data/3b8523a3e/c857725abf6742879ac2c9348d4ff6ce [2018-12-09 00:13:24,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:13:24,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:13:24,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:13:24,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:13:24,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:13:24,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a63a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24, skipping insertion in model container [2018-12-09 00:13:24,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:13:24,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:13:24,426 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:13:24,428 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:13:24,437 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:13:24,444 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:13:24,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24 WrapperNode [2018-12-09 00:13:24,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:13:24,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:13:24,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:13:24,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:13:24,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:13:24,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:13:24,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:13:24,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:13:24,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... [2018-12-09 00:13:24,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:13:24,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:13:24,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:13:24,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:13:24,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:13:24,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:13:24,604 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:13:24,604 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 00:13:24,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:13:24 BoogieIcfgContainer [2018-12-09 00:13:24,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:13:24,605 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:13:24,605 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:13:24,607 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:13:24,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:13:24,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:13:24" (1/3) ... [2018-12-09 00:13:24,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ef37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:13:24, skipping insertion in model container [2018-12-09 00:13:24,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:13:24,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:13:24" (2/3) ... [2018-12-09 00:13:24,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65ef37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:13:24, skipping insertion in model container [2018-12-09 00:13:24,609 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:13:24,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:13:24" (3/3) ... [2018-12-09 00:13:24,609 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-12-09 00:13:24,650 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:13:24,650 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:13:24,651 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:13:24,651 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:13:24,651 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:13:24,651 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:13:24,651 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:13:24,651 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:13:24,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:13:24,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-09 00:13:24,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:24,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:24,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:24,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 00:13:24,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:24,676 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:13:24,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-09 00:13:24,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:24,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:24,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:24,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 00:13:24,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:24,682 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-12-09 00:13:24,682 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-12-09 00:13:24,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-09 00:13:24,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-12-09 00:13:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-12-09 00:13:24,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:24,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:24,793 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:24,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:24,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:24,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:24,794 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:24,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:24,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:24,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:24,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-09 00:13:24,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:24,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:24,897 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:24,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:24,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:24,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:24,921 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:24,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:24,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:24,939 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:24,939 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:24,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:24,942 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:24,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:24,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:24,974 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:24,975 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:24,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:24,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:24,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:24,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:24,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:24,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:24,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:24,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-09 00:13:24,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:24,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:24,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:24,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,029 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,033 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:25,035 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-12-09 00:13:25,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:25,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:25,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,045 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-12-09 00:13:25,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:25,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:25,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,054 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-12-09 00:13:25,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:25,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:25,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:25,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:25,064 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:25,064 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:25,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:25,065 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:25,066 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:25,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:13:25,067 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:25,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,112 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-12-09 00:13:25,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-12-09 00:13:25,140 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-12-09 00:13:25,141 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-12-09 00:13:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-09 00:13:25,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-09 00:13:25,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 00:13:25,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-09 00:13:25,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-09 00:13:25,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:25,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-12-09 00:13:25,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-09 00:13:25,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-09 00:13:25,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-12-09 00:13:25,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:25,151 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-09 00:13:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-12-09 00:13:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-09 00:13:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-09 00:13:25,166 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-09 00:13:25,166 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-09 00:13:25,166 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:13:25,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-12-09 00:13:25,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:25,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:25,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:25,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 00:13:25,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:25,167 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-12-09 00:13:25,167 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-12-09 00:13:25,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-12-09 00:13:25,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-12-09 00:13:25,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-12-09 00:13:25,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,193 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:25,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 00:13:25,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,259 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:25,276 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,279 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:25,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,311 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:25,312 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:25,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 00:13:25,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,349 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,349 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:25,349 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-12-09 00:13:25,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:25,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:25,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,354 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-12-09 00:13:25,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:25,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:25,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:25,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:25,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:25,359 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:25,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:25,359 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:25,360 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:25,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-09 00:13:25,360 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:25,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,385 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-12-09 00:13:25,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-09 00:13:25,395 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-12-09 00:13:25,396 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-12-09 00:13:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-09 00:13:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 00:13:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 00:13:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-09 00:13:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-12-09 00:13:25,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:25,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-12-09 00:13:25,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-09 00:13:25,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 00:13:25,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-12-09 00:13:25,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:25,399 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 00:13:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-12-09 00:13:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-09 00:13:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:13:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-09 00:13:25,400 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 00:13:25,400 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 00:13:25,400 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:13:25,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-09 00:13:25,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:13:25,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:25,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:25,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-09 00:13:25,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:25,402 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-12-09 00:13:25,402 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-12-09 00:13:25,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-12-09 00:13:25,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:25,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-12-09 00:13:25,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-12-09 00:13:25,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,431 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,431 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:25,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-09 00:13:25,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,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-12-09 00:13:25,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,472 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,474 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:25,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,519 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:25,520 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:25,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-09 00:13:25,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:25,560 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-12-09 00:13:25,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:25,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:25,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:25,563 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:25,565 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:25,565 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:25,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:25,565 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:25,565 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:25,565 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:13:25,566 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:25,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,580 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-12-09 00:13:25,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:13:25,585 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-12-09 00:13:25,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-12-09 00:13:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-09 00:13:25,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 00:13:25,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,586 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:25,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,604 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-12-09 00:13:25,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:13:25,608 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-12-09 00:13:25,608 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-12-09 00:13:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-09 00:13:25,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 00:13:25,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,624 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-12-09 00:13:25,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:13:25,629 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-12-09 00:13:25,629 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-12-09 00:13:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-09 00:13:25,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 00:13:25,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-09 00:13:25,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 00:13:25,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-12-09 00:13:25,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:13:25,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-12-09 00:13:25,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-09 00:13:25,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 00:13:25,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-12-09 00:13:25,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:25,632 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-09 00:13:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-12-09 00:13:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-12-09 00:13:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:13:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-09 00:13:25,633 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-09 00:13:25,633 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-09 00:13:25,633 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:13:25,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-12-09 00:13:25,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:13:25,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:25,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:25,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 00:13:25,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:25,633 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-12-09 00:13:25,633 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-12-09 00:13:25,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-09 00:13:25,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-12-09 00:13:25,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-12-09 00:13:25,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,656 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,656 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,657 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:25,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-09 00:13:25,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,711 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,729 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:25,730 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,733 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:25,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,754 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:25,755 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:25,784 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,787 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:25,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:25,818 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:25,819 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:25,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-09 00:13:25,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,819 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:25,866 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-12-09 00:13:25,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:25,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:25,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:25,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,870 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-12-09 00:13:25,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:25,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:25,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,874 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-12-09 00:13:25,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:25,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:25,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:25,879 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-12-09 00:13:25,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:25,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:25,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:25,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:25,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:25,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:25,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:25,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:25,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:25,883 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 00:13:25,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:25,884 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:25,884 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:25,884 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-12-09 00:13:25,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:25,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,911 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-12-09 00:13:25,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-09 00:13:25,915 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-12-09 00:13:25,916 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-12-09 00:13:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-12-09 00:13:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-09 00:13:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 00:13:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-09 00:13:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:25,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-12-09 00:13:25,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:13:25,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-12-09 00:13:25,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-09 00:13:25,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-09 00:13:25,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-12-09 00:13:25,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:25,917 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-09 00:13:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-12-09 00:13:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-09 00:13:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:13:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-12-09 00:13:25,918 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-09 00:13:25,918 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-09 00:13:25,918 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 00:13:25,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-12-09 00:13:25,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:13:25,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:25,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:25,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-12-09 00:13:25,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:13:25,920 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-12-09 00:13:25,920 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-12-09 00:13:25,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-12-09 00:13:25,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:25,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:13:25,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:13:25,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:13:25,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-12-09 00:13:25,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:25,957 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:25,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:25,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:25,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:25,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:25,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:25,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:25,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:25,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 00:13:25,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:25,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:25,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:25,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:25,991 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:25,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:25,993 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:26,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,037 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:26,037 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,052 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:26,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:26,085 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:26,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:26,085 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:26,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:26,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:26,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:26,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:26,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:26,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 00:13:26,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:26,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:26,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:26,146 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:26,146 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-12-09 00:13:26,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:26,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:26,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:26,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:26,149 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-12-09 00:13:26,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:26,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:26,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:26,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-12-09 00:13:26,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:26,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:26,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:26,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:26,154 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:26,155 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 00:13:26,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:26,155 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:26,155 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:26,155 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-12-09 00:13:26,155 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:26,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,182 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-12-09 00:13:26,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 00:13:26,187 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-12-09 00:13:26,188 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-12-09 00:13:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-09 00:13:26,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 00:13:26,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,188 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,209 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-12-09 00:13:26,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 00:13:26,222 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-12-09 00:13:26,222 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-12-09 00:13:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:26,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 00:13:26,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,223 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,246 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-12-09 00:13:26,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 00:13:26,251 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-12-09 00:13:26,251 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-12-09 00:13:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:13:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-09 00:13:26,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 00:13:26,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-09 00:13:26,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-09 00:13:26,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-09 00:13:26,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 00:13:26,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-12-09 00:13:26,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-09 00:13:26,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-09 00:13:26,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-09 00:13:26,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:26,254 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-09 00:13:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-09 00:13:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-12-09 00:13:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-09 00:13:26,255 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-09 00:13:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:13:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:13:26,258 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-12-09 00:13:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:13:26,267 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-09 00:13:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:13:26,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-12-09 00:13:26,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 00:13:26,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-12-09 00:13:26,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-09 00:13:26,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-09 00:13:26,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-09 00:13:26,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:26,269 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 00:13:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-09 00:13:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-09 00:13:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-09 00:13:26,269 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-09 00:13:26,270 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-09 00:13:26,270 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 00:13:26,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-09 00:13:26,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 00:13:26,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:26,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:26,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-12-09 00:13:26,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-12-09 00:13:26,270 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-12-09 00:13:26,271 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-12-09 00:13:26,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-12-09 00:13:26,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:26,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-12-09 00:13:26,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:26,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:26,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-12-09 00:13:26,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:26,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,313 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:26,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:26,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:26,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:26,314 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:26,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:26,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:26,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:26,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 00:13:26,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:26,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:26,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:26,346 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:26,362 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:26,380 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,382 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:26,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,401 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:26,416 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:26,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:26,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:26,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:26,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:26,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:26,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:26,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:26,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 00:13:26,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:26,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:26,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:26,460 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:26,460 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-12-09 00:13:26,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:26,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:26,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:26,463 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:26,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:26,464 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 00:13:26,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:26,464 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:26,464 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:26,464 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-12-09 00:13:26,465 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:26,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,495 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-12-09 00:13:26,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:13:26,499 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-12-09 00:13:26,499 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-12-09 00:13:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:13:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-09 00:13:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:13:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,500 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,529 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-12-09 00:13:26,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:13:26,540 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-12-09 00:13:26,540 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-12-09 00:13:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:13:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:26,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:13:26,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,541 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,570 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-12-09 00:13:26,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:13:26,574 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-12-09 00:13:26,575 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-12-09 00:13:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:13:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-09 00:13:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:13:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,575 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,602 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-12-09 00:13:26,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:13:26,612 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-12-09 00:13:26,613 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-12-09 00:13:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:13:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-09 00:13:26,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:13:26,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:26,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:26,647 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-12-09 00:13:26,648 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:13:26,687 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-12-09 00:13:26,688 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-12-09 00:13:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:13:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-09 00:13:26,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:13:26,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 00:13:26,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-09 00:13:26,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:26,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-12-09 00:13:26,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-09 00:13:26,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-12-09 00:13:26,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-09 00:13:26,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-09 00:13:26,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-12-09 00:13:26,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:26,695 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-12-09 00:13:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-12-09 00:13:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-12-09 00:13:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 00:13:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-12-09 00:13:26,698 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-09 00:13:26,698 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-09 00:13:26,698 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 00:13:26,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-12-09 00:13:26,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 00:13:26,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:26,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:26,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-12-09 00:13:26,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-09 00:13:26,699 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-12-09 00:13:26,699 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-12-09 00:13:26,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-12-09 00:13:26,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:26,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:13:26,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:13:26,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,727 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 00:13:26,735 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 00:13:26,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:13:26,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:13:26,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:13:26,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-09 00:13:26,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:13:26,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-12-09 00:13:26,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:26,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:26,808 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:26,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:26,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:26,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:26,808 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:26,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:26,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:26,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:26,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-09 00:13:26,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:26,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:26,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,846 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:26,846 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,865 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:26,865 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:26,883 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:26,886 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:26,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:26,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:26,942 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:26,944 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:26,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:26,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:26,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:26,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:26,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:26,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:26,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:26,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-09 00:13:26,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:26,945 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:26,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:26,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:26,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:26,987 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-12-09 00:13:26,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:26,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:26,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:26,991 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-12-09 00:13:26,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:26,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:26,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:26,995 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-12-09 00:13:26,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:26,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:26,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:26,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:26,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:26,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:26,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:26,997 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:26,999 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:26,999 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:26,999 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:27,000 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:27,000 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:27,000 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-09 00:13:27,000 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:27,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:13:27,026 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-12-09 00:13:27,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-09 00:13:27,049 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-12-09 00:13:27,049 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-12-09 00:13:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:13:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-09 00:13:27,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-09 00:13:27,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-09 00:13:27,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-12-09 00:13:27,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2018-12-09 00:13:27,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 00:13:27,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2018-12-09 00:13:27,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-09 00:13:27,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-09 00:13:27,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2018-12-09 00:13:27,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:27,051 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2018-12-09 00:13:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2018-12-09 00:13:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-09 00:13:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 00:13:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-12-09 00:13:27,053 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-12-09 00:13:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:13:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:13:27,053 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2018-12-09 00:13:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:13:27,061 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-09 00:13:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:13:27,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-12-09 00:13:27,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 00:13:27,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2018-12-09 00:13:27,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-09 00:13:27,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-09 00:13:27,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-09 00:13:27,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:27,063 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-09 00:13:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-09 00:13:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-12-09 00:13:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:13:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-12-09 00:13:27,064 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-09 00:13:27,064 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-09 00:13:27,064 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 00:13:27,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-12-09 00:13:27,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 00:13:27,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:27,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:27,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-12-09 00:13:27,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-09 00:13:27,065 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-12-09 00:13:27,065 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-12-09 00:13:27,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-12-09 00:13:27,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-12-09 00:13:27,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-12-09 00:13:27,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:13:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:13:27,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:13:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:13:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 00:13:27,167 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:27,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:27,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:27,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:27,168 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:27,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:27,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:27,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:27,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-09 00:13:27,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:27,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:27,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,216 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:27,216 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:27,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:27,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:27,232 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:27,235 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:27,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:27,255 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:27,268 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:27,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:27,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:27,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:27,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:27,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:27,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:27,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:27,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-09 00:13:27,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:27,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:27,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:27,306 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:27,307 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-12-09 00:13:27,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:27,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:27,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:27,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:27,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:27,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:27,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:27,309 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-12-09 00:13:27,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:27,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:27,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:27,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:27,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:27,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:27,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:27,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:27,312 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:27,312 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:27,312 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:27,312 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:27,313 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:27,313 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:13:27,313 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:27,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,343 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-12-09 00:13:27,343 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 00:13:27,354 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-12-09 00:13:27,354 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-12-09 00:13:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:13:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-09 00:13:27,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 00:13:27,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,355 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,395 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-12-09 00:13:27,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 00:13:27,409 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-12-09 00:13:27,409 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-12-09 00:13:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:13:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-09 00:13:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 00:13:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,409 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,443 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-12-09 00:13:27,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 00:13:27,460 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-12-09 00:13:27,461 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-12-09 00:13:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:13:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-09 00:13:27,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 00:13:27,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-12-09 00:13:27,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-12-09 00:13:27,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-12-09 00:13:27,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-12-09 00:13:27,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-12-09 00:13:27,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-09 00:13:27,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-09 00:13:27,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-12-09 00:13:27,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:27,465 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-09 00:13:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-12-09 00:13:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-12-09 00:13:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:13:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-12-09 00:13:27,467 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-12-09 00:13:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:13:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:13:27,468 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-12-09 00:13:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:13:27,481 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-12-09 00:13:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:13:27,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-12-09 00:13:27,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-09 00:13:27,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-12-09 00:13:27,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-09 00:13:27,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 00:13:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-12-09 00:13:27,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:27,483 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-12-09 00:13:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-12-09 00:13:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-12-09 00:13:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:13:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-09 00:13:27,485 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-09 00:13:27,485 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-09 00:13:27,485 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 00:13:27,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-12-09 00:13:27,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 00:13:27,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:27,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:27,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-09 00:13:27,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-12-09 00:13:27,486 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-12-09 00:13:27,486 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-12-09 00:13:27,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-12-09 00:13:27,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-12-09 00:13:27,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:13:27,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:13:27,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:13:27,505 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:13:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:13:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:13:27,505 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-09 00:13:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:13:27,513 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-12-09 00:13:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:13:27,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-12-09 00:13:27,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 00:13:27,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-12-09 00:13:27,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 00:13:27,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 00:13:27,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-12-09 00:13:27,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:27,514 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-09 00:13:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-12-09 00:13:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-09 00:13:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:13:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-09 00:13:27,515 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-09 00:13:27,515 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-09 00:13:27,515 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 00:13:27,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-12-09 00:13:27,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 00:13:27,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:27,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:27,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-09 00:13:27,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-12-09 00:13:27,516 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-12-09 00:13:27,516 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-12-09 00:13:27,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-12-09 00:13:27,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-12-09 00:13:27,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-12-09 00:13:27,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:27,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:27,585 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:27,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:27,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:27,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:27,585 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:27,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:27,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:27,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:27,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-12-09 00:13:27,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:27,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:27,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:27,616 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:27,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:27,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:13:27,633 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_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:27,637 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:27,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:27,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:27,669 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:27,670 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:27,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:27,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:27,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:27,671 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:27,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:27,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:27,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:27,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-12-09 00:13:27,671 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:27,671 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:27,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:27,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:27,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:27,709 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-12-09 00:13:27,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:27,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:27,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:27,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:27,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:13:27,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:13:27,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:13:27,712 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-12-09 00:13:27,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:27,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:27,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:27,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:27,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:27,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:27,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:27,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:27,716 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:27,716 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:27,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:27,716 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:27,716 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:27,716 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:13:27,717 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:27,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,775 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-12-09 00:13:27,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 00:13:27,777 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-12-09 00:13:27,778 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-12-09 00:13:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 00:13:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,778 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,812 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-12-09 00:13:27,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 00:13:27,814 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-12-09 00:13:27,815 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-12-09 00:13:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:27,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 00:13:27,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,815 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,857 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-12-09 00:13:27,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 00:13:27,861 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-12-09 00:13:27,861 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-12-09 00:13:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-09 00:13:27,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 00:13:27,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,862 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,896 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-12-09 00:13:27,896 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 00:13:27,913 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-12-09 00:13:27,913 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-12-09 00:13:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-09 00:13:27,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 00:13:27,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:27,914 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:27,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:27,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:27,953 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-12-09 00:13:27,953 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-09 00:13:27,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:27,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:27,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:27,993 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:27,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,024 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,025 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,025 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,025 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,025 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,025 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,026 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,026 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,030 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-12-09 00:13:28,030 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-12-09 00:13:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:13:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-12-09 00:13:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 00:13:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-12-09 00:13:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-12-09 00:13:28,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-12-09 00:13:28,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-12-09 00:13:28,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-12-09 00:13:28,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-09 00:13:28,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 00:13:28,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-12-09 00:13:28,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:28,036 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-12-09 00:13:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-12-09 00:13:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-12-09 00:13:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 00:13:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-12-09 00:13:28,039 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-09 00:13:28,039 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-09 00:13:28,039 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 00:13:28,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-12-09 00:13:28,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-09 00:13:28,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:28,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:28,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-09 00:13:28,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-12-09 00:13:28,040 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-12-09 00:13:28,040 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-12-09 00:13:28,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-12-09 00:13:28,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-12-09 00:13:28,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-12-09 00:13:28,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,124 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:28,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:28,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:28,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:28,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:28,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:28,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:28,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:28,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-12-09 00:13:28,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:28,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:28,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:28,158 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:28,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:28,159 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:28,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:28,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:28,178 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:28,191 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:28,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:28,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:28,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:28,191 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:28,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:28,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:28,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:28,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-12-09 00:13:28,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:28,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:28,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,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-12-09 00:13:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,224 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:28,224 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:28,224 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-12-09 00:13:28,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:28,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:28,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:28,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:28,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:28,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:28,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:28,227 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:28,227 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:28,227 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:28,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:28,228 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:28,228 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:28,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:13:28,228 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:28,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:28,282 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-12-09 00:13:28,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-09 00:13:28,285 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-12-09 00:13:28,285 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-12-09 00:13:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 00:13:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:28,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-09 00:13:28,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:28,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:28,354 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-12-09 00:13:28,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-09 00:13:28,357 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-12-09 00:13:28,357 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-12-09 00:13:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 00:13:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-09 00:13:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,358 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:28,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:28,406 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-12-09 00:13:28,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-09 00:13:28,409 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-12-09 00:13:28,410 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-12-09 00:13:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 00:13:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-09 00:13:28,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-09 00:13:28,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,410 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:28,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:28,458 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-12-09 00:13:28,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-09 00:13:28,474 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-12-09 00:13:28,474 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-12-09 00:13:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 00:13:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-09 00:13:28,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-09 00:13:28,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,475 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:28,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:13:28,531 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-12-09 00:13:28,532 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-09 00:13:28,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,557 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,560 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,560 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,561 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,561 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,584 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,584 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,584 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,584 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,584 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,586 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,586 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,586 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,586 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,586 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,588 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,588 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,588 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,589 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,590 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,590 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,590 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,591 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,619 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,620 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,620 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,620 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,620 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,620 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,622 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-09 00:13:28,641 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-12-09 00:13:28,642 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-12-09 00:13:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 00:13:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-12-09 00:13:28,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-09 00:13:28,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-12-09 00:13:28,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-12-09 00:13:28,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-12-09 00:13:28,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-09 00:13:28,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-12-09 00:13:28,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-09 00:13:28,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 00:13:28,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-12-09 00:13:28,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:13:28,662 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-12-09 00:13:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-12-09 00:13:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-12-09 00:13:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 00:13:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-12-09 00:13:28,673 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-09 00:13:28,673 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-09 00:13:28,673 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 00:13:28,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-12-09 00:13:28,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-09 00:13:28,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:13:28,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:13:28,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-09 00:13:28,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-12-09 00:13:28,675 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-12-09 00:13:28,675 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-12-09 00:13:28,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-12-09 00:13:28,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:13:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-12-09 00:13:28,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-12-09 00:13:28,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:13:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:13:28,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:13:28,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:13:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:13:28,798 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:28,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:28,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:28,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:28,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:13:28,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:28,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:28,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:28,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-09 00:13:28,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:28,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:28,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,830 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:28,830 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:28,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:13:28,832 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_673b2319-1585-4ac5-9584-1eaf4eeb3c9e/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-12-09 00:13:28,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:13:28,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:13:28,889 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:13:28,890 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:13:28,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:13:28,890 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:13:28,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:13:28,890 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:13:28,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:13:28,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:13:28,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:13:28,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-09 00:13:28,891 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:13:28,891 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:13:28,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:13:28,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:13:28,924 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:13:28,924 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-12-09 00:13:28,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:13:28,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:13:28,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:13:28,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:13:28,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:13:28,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:13:28,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:13:28,925 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:13:28,926 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:13:28,926 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:13:28,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:13:28,927 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:13:28,927 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:13:28,927 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-09 00:13:28,927 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:13:28,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:13:28,975 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-12-09 00:13:28,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-09 00:13:28,979 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-12-09 00:13:28,979 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-12-09 00:13:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:13:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:28,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-09 00:13:28,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:28,980 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:28,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:28,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:13:29,022 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-12-09 00:13:29,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-09 00:13:29,031 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-12-09 00:13:29,032 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-12-09 00:13:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:13:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-09 00:13:29,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-09 00:13:29,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:29,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:29,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:29,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:29,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:13:29,077 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-12-09 00:13:29,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-09 00:13:29,094 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-12-09 00:13:29,094 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-12-09 00:13:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:13:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 00:13:29,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-09 00:13:29,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:29,095 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:13:29,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:13:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:29,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:13:29,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:13:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:13:29,141 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-12-09 00:13:29,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-12-09 00:13:29,165 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-12-09 00:13:29,165 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-12-09 00:13:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:13:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-12-09 00:13:29,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-09 00:13:29,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:29,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2018-12-09 00:13:29,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:29,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2018-12-09 00:13:29,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:13:29,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2018-12-09 00:13:29,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:13:29,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:13:29,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:13:29,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:13:29,170 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 00:13:29,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:13:29,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:13:29,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:13:29,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:13:29 BoogieIcfgContainer [2018-12-09 00:13:29,176 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:13:29,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:13:29,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:13:29,177 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:13:29,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:13:24" (3/4) ... [2018-12-09 00:13:29,180 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:13:29,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:13:29,181 INFO L168 Benchmark]: Toolchain (without parser) took 4862.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 954.4 MB in the beginning and 897.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:13:29,182 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:13:29,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.79 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 945.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:13:29,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.91 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:13:29,183 INFO L168 Benchmark]: Boogie Preprocessor took 9.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:13:29,183 INFO L168 Benchmark]: RCFGBuilder took 132.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:13:29,184 INFO L168 Benchmark]: BuchiAutomizer took 4571.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 902.8 MB in the end (delta: 188.4 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:13:29,184 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.2 GB. Free memory was 902.8 MB in the beginning and 897.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:13:29,186 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.79 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 945.2 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 16.91 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 132.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4571.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 902.8 MB in the end (delta: 188.4 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.2 GB. Free memory was 902.8 MB in the beginning and 897.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. 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 4.5s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. 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.1s 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.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...