./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.24-678e011 [2019-11-19 22:20:38,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:20:38,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:20:38,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:20:38,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:20:38,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:20:38,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:20:38,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:20:38,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:20:38,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:20:38,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:20:38,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:20:38,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:20:38,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:20:38,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:20:38,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:20:38,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:20:38,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:20:38,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:20:38,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:20:38,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:20:38,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:20:38,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:20:38,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:20:38,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:20:38,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:20:38,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:20:38,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:20:38,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:20:38,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:20:38,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:20:38,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:20:38,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:20:38,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:20:38,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:20:38,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:20:38,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:20:38,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:20:38,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:20:38,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:20:38,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:20:38,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:20:38,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:20:38,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:20:38,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:20:38,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:20:38,583 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:20:38,583 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:20:38,584 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:20:38,584 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:20:38,584 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:20:38,584 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:20:38,585 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:20:38,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:20:38,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:20:38,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:20:38,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:20:38,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:20:38,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:20:38,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:20:38,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:20:38,587 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:20:38,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:20:38,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:20:38,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:20:38,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:20:38,588 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:20:38,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:20:38,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:20:38,589 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:20:38,590 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:20:38,591 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2019-11-19 22:20:38,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:20:38,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:20:38,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:20:38,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:20:38,941 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:20:38,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-19 22:20:39,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff05cad6/8ccce1f164c44467ba037b755367079a/FLAGf8991391a [2019-11-19 22:20:39,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:20:39,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-19 22:20:39,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff05cad6/8ccce1f164c44467ba037b755367079a/FLAGf8991391a [2019-11-19 22:20:39,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff05cad6/8ccce1f164c44467ba037b755367079a [2019-11-19 22:20:39,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:20:39,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:20:39,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:39,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:20:39,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:20:39,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:39" (1/1) ... [2019-11-19 22:20:39,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f086dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:39, skipping insertion in model container [2019-11-19 22:20:39,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:39" (1/1) ... [2019-11-19 22:20:39,902 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:20:39,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:20:40,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:40,102 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:20:40,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:40,141 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:20:40,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40 WrapperNode [2019-11-19 22:20:40,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:40,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:40,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:20:40,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:20:40,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:40,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:20:40,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:20:40,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:20:40,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... [2019-11-19 22:20:40,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:20:40,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:20:40,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:20:40,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:20:40,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:20:40,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:20:40,469 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:20:40,469 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:20:40,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:40 BoogieIcfgContainer [2019-11-19 22:20:40,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:20:40,471 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:20:40,471 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:20:40,475 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:20:40,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:40,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:20:39" (1/3) ... [2019-11-19 22:20:40,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a7c6b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:40, skipping insertion in model container [2019-11-19 22:20:40,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:40,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:40" (2/3) ... [2019-11-19 22:20:40,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a7c6b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:40, skipping insertion in model container [2019-11-19 22:20:40,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:40,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:40" (3/3) ... [2019-11-19 22:20:40,480 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2019-11-19 22:20:40,524 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:20:40,525 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:20:40,525 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:20:40,525 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:20:40,525 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:20:40,526 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:20:40,526 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:20:40,526 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:20:40,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-19 22:20:40,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:40,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:40,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:40,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 22:20:40,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:40,565 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:20:40,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-19 22:20:40,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:40,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:40,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:40,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 22:20:40,567 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:40,574 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 [2019-11-19 22:20:40,574 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 [2019-11-19 22:20:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-19 22:20:40,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990085005] [2019-11-19 22:20:40,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-19 22:20:40,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:40,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288426267] [2019-11-19 22:20:40,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-19 22:20:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:40,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804870468] [2019-11-19 22:20:40,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:40,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:40,837 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:20:40,948 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:20:40,960 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:40,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:40,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:40,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:40,962 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:40,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:40,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:40,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:40,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-19 22:20:40,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:40,964 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:40,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,143 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:41,144 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:41,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:41,167 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:41,167 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:41,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:41,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:41,184 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:41,207 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:41,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:41,231 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:41,234 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:41,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:41,234 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:41,234 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:41,234 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:41,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:41,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:41,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-19 22:20:41,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:41,236 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:41,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,367 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:41,376 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,384 INFO L120 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 [2019-11-19 22:20:41,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:41,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:41,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:41,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:41,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:41,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:41,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:41,411 INFO L120 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 [2019-11-19 22:20:41,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:41,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:41,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:41,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:41,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:41,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,434 INFO L120 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 [2019-11-19 22:20:41,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:41,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:41,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:41,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:41,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:41,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:41,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:41,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:41,448 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-19 22:20:41,448 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:41,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:41,471 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:41,471 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:41,472 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,478 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:41,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:41,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:41,551 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:41,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:41,573 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 [2019-11-19 22:20:41,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-19 22:20:41,624 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. [2019-11-19 22:20:41,626 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 [2019-11-19 22:20:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-19 22:20:41,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-19 22:20:41,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:41,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-19 22:20:41,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:41,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-19 22:20:41,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:41,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-19 22:20:41,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:41,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-19 22:20:41,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-19 22:20:41,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-19 22:20:41,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-19 22:20:41,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:41,653 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-19 22:20:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-19 22:20:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-19 22:20:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-19 22:20:41,690 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-19 22:20:41,691 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-19 22:20:41,691 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:20:41,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-19 22:20:41,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:41,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:41,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:41,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:20:41,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:41,694 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 [2019-11-19 22:20:41,694 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 [2019-11-19 22:20:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-19 22:20:41,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:41,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22746887] [2019-11-19 22:20:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,708 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-19 22:20:41,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:41,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477456419] [2019-11-19 22:20:41,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-19 22:20:41,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039159051] [2019-11-19 22:20:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:41,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:41,765 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:41,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:41,765 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:41,765 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:41,765 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:41,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:41,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:41,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-19 22:20:41,766 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:41,766 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:41,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:41,855 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:41,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:41,871 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:41,877 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:41,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:41,900 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:41,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:41,927 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,939 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:41,942 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:41,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:41,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:41,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:41,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:41,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:41,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:41,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:41,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-19 22:20:41,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:41,945 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:41,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:41,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:42,050 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,064 INFO L120 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 [2019-11-19 22:20:42,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:42,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:42,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:42,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:42,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:42,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,100 INFO L120 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 [2019-11-19 22:20:42,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:42,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:42,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:42,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:42,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:42,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:42,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:42,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:42,130 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,136 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:42,137 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:42,137 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:42,137 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-19 22:20:42,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,183 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:42,199 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 [2019-11-19 22:20:42,200 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-19 22:20:42,221 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. [2019-11-19 22:20:42,223 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 [2019-11-19 22:20:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-19 22:20:42,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-19 22:20:42,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-19 22:20:42,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-19 22:20:42,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-19 22:20:42,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:42,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-19 22:20:42,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:20:42,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:20:42,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-19 22:20:42,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:42,230 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-19 22:20:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-19 22:20:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-19 22:20:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-19 22:20:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-19 22:20:42,236 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-19 22:20:42,236 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-19 22:20:42,237 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:20:42,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-19 22:20:42,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:20:42,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:42,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:42,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-19 22:20:42,240 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:42,240 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 [2019-11-19 22:20:42,240 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 [2019-11-19 22:20:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-19 22:20:42,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139390614] [2019-11-19 22:20:42,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-19 22:20:42,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901654006] [2019-11-19 22:20:42,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-19 22:20:42,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956181093] [2019-11-19 22:20:42,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,342 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:42,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:42,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:42,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:42,343 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:42,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:42,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:42,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-19 22:20:42,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:42,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:42,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:42,420 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:42,430 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:42,452 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,460 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:42,463 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:42,464 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:42,464 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:42,464 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:42,464 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:42,464 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,464 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:42,465 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:42,465 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-19 22:20:42,465 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:42,465 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:42,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,576 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:42,576 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:42,587 INFO L120 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 [2019-11-19 22:20:42,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:42,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:42,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:42,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:42,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:42,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:42,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:42,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:42,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:42,599 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:42,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:42,604 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:42,604 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:42,605 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-19 22:20:42,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,637 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:42,639 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 [2019-11-19 22:20:42,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-19 22:20:42,649 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. [2019-11-19 22:20:42,649 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 [2019-11-19 22:20:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-19 22:20:42,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-19 22:20:42,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,651 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:42,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,692 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:42,693 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 [2019-11-19 22:20:42,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-19 22:20:42,702 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. [2019-11-19 22:20:42,703 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 [2019-11-19 22:20:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-19 22:20:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-19 22:20:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,704 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:42,736 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:42,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:42,738 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 [2019-11-19 22:20:42,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-19 22:20:42,752 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. [2019-11-19 22:20:42,753 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 [2019-11-19 22:20:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-19 22:20:42,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-19 22:20:42,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-19 22:20:42,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-19 22:20:42,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:42,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-19 22:20:42,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-19 22:20:42,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-19 22:20:42,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-19 22:20:42,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:20:42,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-19 22:20:42,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:42,758 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-19 22:20:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-19 22:20:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-19 22:20:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:20:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-19 22:20:42,759 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-19 22:20:42,759 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-19 22:20:42,759 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:20:42,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-19 22:20:42,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-19 22:20:42,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:42,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:42,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 22:20:42,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:42,761 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 [2019-11-19 22:20:42,761 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 [2019-11-19 22:20:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,761 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-19 22:20:42,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270702652] [2019-11-19 22:20:42,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,767 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-19 22:20:42,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623288726] [2019-11-19 22:20:42,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,776 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-19 22:20:42,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:42,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158485416] [2019-11-19 22:20:42,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:42,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:42,812 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:42,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:42,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:42,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:42,813 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:42,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:42,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:42,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-19 22:20:42,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:42,813 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:42,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:42,889 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:42,889 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:42,907 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:42,915 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:42,944 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:42,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:42,976 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:42,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:42,990 INFO L440 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=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [0, 1, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:43,010 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:43,015 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:43,025 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:43,041 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:43,051 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:43,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:43,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:43,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:43,052 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:43,052 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,052 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:43,052 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:43,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-19 22:20:43,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:43,053 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:43,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,141 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:43,142 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,179 INFO L120 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 [2019-11-19 22:20:43,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:43,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:43,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,209 INFO L120 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 [2019-11-19 22:20:43,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:43,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,240 INFO L120 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 [2019-11-19 22:20:43,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:43,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,258 INFO L120 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 [2019-11-19 22:20:43,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:43,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:43,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:43,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:43,270 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:43,274 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:43,274 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:43,274 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-19 22:20:43,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,309 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:43,310 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 [2019-11-19 22:20:43,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-19 22:20:43,325 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. [2019-11-19 22:20:43,326 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 [2019-11-19 22:20:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-19 22:20:43,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-19 22:20:43,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-19 22:20:43,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-19 22:20:43,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-19 22:20:43,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-19 22:20:43,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-19 22:20:43,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-19 22:20:43,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-19 22:20:43,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-19 22:20:43,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:43,332 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-19 22:20:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-19 22:20:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-19 22:20:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-19 22:20:43,333 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-19 22:20:43,333 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-19 22:20:43,333 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:20:43,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-19 22:20:43,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-19 22:20:43,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:43,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:43,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-19 22:20:43,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:20:43,338 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 [2019-11-19 22:20:43,339 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 [2019-11-19 22:20:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-19 22:20:43,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:43,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825677918] [2019-11-19 22:20:43,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:43,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825677918] [2019-11-19 22:20:43,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:20:43,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:20:43,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176543546] [2019-11-19 22:20:43,396 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:20:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-19 22:20:43,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:43,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932879126] [2019-11-19 22:20:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:43,426 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:43,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:43,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:43,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:43,427 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:43,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:43,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:43,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-19 22:20:43,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:43,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:43,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:43,492 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:43,503 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:43,514 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:43,533 INFO L440 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=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 15, 7] Nus: [1, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:43,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:43,538 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:43,556 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,571 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:43,573 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:43,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:43,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:43,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:43,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:43,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:43,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:43,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-19 22:20:43,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:43,574 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:43,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:43,649 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:43,649 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,660 INFO L120 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 [2019-11-19 22:20:43,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:43,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:43,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:43,672 INFO L120 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 [2019-11-19 22:20:43,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:43,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:43,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,695 INFO L120 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 [2019-11-19 22:20:43,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:43,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:43,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:43,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:43,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:43,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:43,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:43,705 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:43,705 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:43,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:43,710 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:43,711 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:43,711 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-19 22:20:43,713 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,749 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:43,782 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 [2019-11-19 22:20:43,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:20:43,790 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. [2019-11-19 22:20:43,792 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 [2019-11-19 22:20:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-19 22:20:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 22:20:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,792 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:43,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,817 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:43,832 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 [2019-11-19 22:20:43,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:20:43,858 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. [2019-11-19 22:20:43,858 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 [2019-11-19 22:20:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 22:20:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,859 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:43,888 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:20:43,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:43,904 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 [2019-11-19 22:20:43,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:20:43,912 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. [2019-11-19 22:20:43,913 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 [2019-11-19 22:20:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:20:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-19 22:20:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 22:20:43,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-19 22:20:43,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-19 22:20:43,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:43,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-19 22:20:43,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:20:43,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-19 22:20:43,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-19 22:20:43,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-19 22:20:43,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-19 22:20:43,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:43,917 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-19 22:20:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-19 22:20:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-19 22:20:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-19 22:20:43,919 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-19 22:20:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:20:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:20:43,923 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-19 22:20:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:43,939 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-19 22:20:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:20:43,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-19 22:20:43,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:20:43,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-19 22:20:43,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-19 22:20:43,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-19 22:20:43,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-19 22:20:43,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:43,943 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-19 22:20:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-19 22:20:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-19 22:20:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-19 22:20:43,944 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 22:20:43,944 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 22:20:43,944 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:20:43,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-19 22:20:43,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:20:43,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:43,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:43,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-19 22:20:43,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-19 22:20:43,946 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 [2019-11-19 22:20:43,946 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 [2019-11-19 22:20:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-19 22:20:43,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:43,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185470822] [2019-11-19 22:20:43,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-19 22:20:43,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:43,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122764472] [2019-11-19 22:20:43,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-19 22:20:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526423461] [2019-11-19 22:20:43,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:43,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:44,025 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:44,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:44,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:44,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:44,026 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:44,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:44,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:44,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-19 22:20:44,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:44,027 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,088 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:44,088 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:44,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:44,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:44,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:44,103 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:44,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:44,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:44,112 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:44,112 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:44,122 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:44,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:44,134 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:44,136 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:44,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:44,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:44,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:44,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:44,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:44,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:44,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-19 22:20:44,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:44,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:44,210 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,221 INFO L120 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 [2019-11-19 22:20:44,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:44,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:44,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:44,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:44,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:44,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:44,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:44,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:44,229 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:44,229 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:44,233 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:44,233 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:44,233 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2019-11-19 22:20:44,235 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:44,302 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 [2019-11-19 22:20:44,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-19 22:20:44,313 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. [2019-11-19 22:20:44,313 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 [2019-11-19 22:20:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-19 22:20:44,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 22:20:44,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,315 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:44,363 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 [2019-11-19 22:20:44,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-19 22:20:44,383 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. [2019-11-19 22:20:44,384 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 [2019-11-19 22:20:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:44,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 22:20:44,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,384 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:44,458 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 [2019-11-19 22:20:44,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-19 22:20:44,468 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. [2019-11-19 22:20:44,469 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 [2019-11-19 22:20:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-19 22:20:44,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 22:20:44,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,470 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:44,522 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 [2019-11-19 22:20:44,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-19 22:20:44,541 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. [2019-11-19 22:20:44,543 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 [2019-11-19 22:20:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-19 22:20:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 22:20:44,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,544 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:44,595 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 [2019-11-19 22:20:44,596 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-19 22:20:44,665 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 [2019-11-19 22:20:44,667 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 [2019-11-19 22:20:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-19 22:20:44,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 22:20:44,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-19 22:20:44,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-19 22:20:44,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:44,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-19 22:20:44,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-19 22:20:44,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-19 22:20:44,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-19 22:20:44,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-19 22:20:44,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-19 22:20:44,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:44,690 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-19 22:20:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-19 22:20:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-19 22:20:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:20:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-19 22:20:44,697 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-19 22:20:44,697 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-19 22:20:44,697 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:20:44,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-19 22:20:44,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:20:44,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:44,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:44,700 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-19 22:20:44,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-19 22:20:44,701 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 [2019-11-19 22:20:44,701 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 [2019-11-19 22:20:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-19 22:20:44,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:44,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522013527] [2019-11-19 22:20:44,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:20:44,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522013527] [2019-11-19 22:20:44,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929839502] [2019-11-19 22:20:44,770 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:20:44,802 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-19 22:20:44,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:20:44,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:44,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:20:44,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:20:44,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-19 22:20:44,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894701122] [2019-11-19 22:20:44,809 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:20:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-19 22:20:44,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:44,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235941944] [2019-11-19 22:20:44,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:44,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:44,902 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:44,903 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:44,903 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:44,903 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:44,903 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:44,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:44,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:44,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-19 22:20:44,904 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:44,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:44,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:44,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:44,977 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:44,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:44,985 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:44,989 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:44,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:44,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:44,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:44,998 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:45,004 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:45,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:45,057 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:45,059 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:45,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:45,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:45,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:45,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:45,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:45,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:45,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-19 22:20:45,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:45,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:45,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,133 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:45,134 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,140 INFO L120 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 [2019-11-19 22:20:45,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:45,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:45,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:45,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:45,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:45,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:45,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,165 INFO L120 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 [2019-11-19 22:20:45,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:45,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:45,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:45,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:45,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:45,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,183 INFO L120 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 [2019-11-19 22:20:45,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:45,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:45,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:45,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:45,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:45,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:45,192 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-19 22:20:45,192 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:45,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:45,198 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:45,199 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-19 22:20:45,202 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:45,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:45,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:45,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:45,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:20:45,269 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 [2019-11-19 22:20:45,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-19 22:20:45,311 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. [2019-11-19 22:20:45,314 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 [2019-11-19 22:20:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:20:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-19 22:20:45,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-19 22:20:45,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:45,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-19 22:20:45,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:45,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-19 22:20:45,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:45,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-11-19 22:20:45,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:20:45,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-11-19 22:20:45,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-19 22:20:45,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-19 22:20:45,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-11-19 22:20:45,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:45,320 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-19 22:20:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-11-19 22:20:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-19 22:20:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 22:20:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-11-19 22:20:45,325 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-11-19 22:20:45,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:20:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:20:45,326 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-11-19 22:20:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:45,344 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-19 22:20:45,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:20:45,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-19 22:20:45,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:20:45,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-11-19 22:20:45,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-19 22:20:45,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-19 22:20:45,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-19 22:20:45,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:45,349 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-19 22:20:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-19 22:20:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-19 22:20:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 22:20:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-19 22:20:45,351 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-19 22:20:45,351 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-19 22:20:45,351 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:20:45,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-19 22:20:45,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:20:45,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:45,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:45,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-19 22:20:45,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-19 22:20:45,353 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 [2019-11-19 22:20:45,353 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 [2019-11-19 22:20:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-19 22:20:45,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:45,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983084554] [2019-11-19 22:20:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:45,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-19 22:20:45,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:45,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518908799] [2019-11-19 22:20:45,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:45,378 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-19 22:20:45,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:45,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169136780] [2019-11-19 22:20:45,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:45,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169136780] [2019-11-19 22:20:45,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549632015] [2019-11-19 22:20:45,463 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:20:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:45,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:20:45,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:20:45,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:20:45,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-19 22:20:45,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495586250] [2019-11-19 22:20:45,637 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:45,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:45,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:45,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:45,637 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:45,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:45,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:45,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-19 22:20:45,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:45,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:45,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:45,716 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:45,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,732 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:45,732 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:45,739 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:45,749 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,843 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:45,845 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:45,845 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:45,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:45,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:45,845 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:45,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:45,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:45,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-19 22:20:45,846 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:45,846 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:45,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:45,947 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:45,947 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,956 INFO L120 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 [2019-11-19 22:20:45,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:45,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:45,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:45,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:45,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:45,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,971 INFO L120 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 [2019-11-19 22:20:45,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:45,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:45,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:45,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:45,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:45,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:45,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:45,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:45,979 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:45,980 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:45,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:45,984 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:45,985 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:45,985 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-19 22:20:45,987 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:46,059 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 [2019-11-19 22:20:46,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-19 22:20:46,078 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. [2019-11-19 22:20:46,082 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 [2019-11-19 22:20:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:20:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-19 22:20:46,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-19 22:20:46,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:46,083 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:46,144 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 [2019-11-19 22:20:46,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-19 22:20:46,164 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. [2019-11-19 22:20:46,165 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 [2019-11-19 22:20:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:20:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-19 22:20:46,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-19 22:20:46,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:46,166 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:46,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:46,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:46,211 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 [2019-11-19 22:20:46,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-19 22:20:46,245 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. [2019-11-19 22:20:46,246 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 [2019-11-19 22:20:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:20:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-19 22:20:46,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-19 22:20:46,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:46,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-19 22:20:46,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:46,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-19 22:20:46,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:46,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-19 22:20:46,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-19 22:20:46,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-19 22:20:46,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-19 22:20:46,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-19 22:20:46,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-19 22:20:46,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:46,252 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-19 22:20:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-19 22:20:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-19 22:20:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 22:20:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-19 22:20:46,256 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-19 22:20:46,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:20:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:20:46,257 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-19 22:20:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:46,454 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-19 22:20:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:20:46,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-19 22:20:46,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-19 22:20:46,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-19 22:20:46,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-19 22:20:46,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-19 22:20:46,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-19 22:20:46,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:46,459 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-19 22:20:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-19 22:20:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-19 22:20:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 22:20:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-19 22:20:46,463 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-19 22:20:46,463 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-19 22:20:46,463 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:20:46,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-19 22:20:46,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-19 22:20:46,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:46,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:46,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-19 22:20:46,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-19 22:20:46,465 INFO L794 eck$LassoCheckResult]: Stem: 1722#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; 1724#L12-2 assume !!(main_~c~0 > 0); 1738#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1735#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-19 22:20:46,465 INFO L796 eck$LassoCheckResult]: Loop: 1718#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1728#L12-2 assume !!(main_~c~0 > 0); 1734#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1733#L12-2 assume !!(main_~c~0 > 0); 1725#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1726#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-19 22:20:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-19 22:20:46,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:46,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575051008] [2019-11-19 22:20:46,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-19 22:20:46,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:46,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749976404] [2019-11-19 22:20:46,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:20:46,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749976404] [2019-11-19 22:20:46,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:20:46,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:20:46,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325150763] [2019-11-19 22:20:46,498 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:20:46,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:20:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:20:46,499 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-19 22:20:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:46,508 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-19 22:20:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:20:46,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-19 22:20:46,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:20:46,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-19 22:20:46,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-19 22:20:46,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-19 22:20:46,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-19 22:20:46,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:46,512 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-19 22:20:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-19 22:20:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-19 22:20:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 22:20:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-19 22:20:46,515 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-19 22:20:46,515 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-19 22:20:46,515 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:20:46,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-19 22:20:46,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:20:46,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:46,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:46,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-19 22:20:46,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-19 22:20:46,517 INFO L794 eck$LassoCheckResult]: Stem: 1813#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; 1815#L12-2 assume !!(main_~c~0 > 0); 1829#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1828#L12-2 assume !!(main_~c~0 > 0); 1821#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-19 22:20:46,517 INFO L796 eck$LassoCheckResult]: Loop: 1809#L12-2 assume !!(main_~c~0 > 0); 1810#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1819#L12-2 assume !!(main_~c~0 > 0); 1826#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1823#L12-2 assume !!(main_~c~0 > 0); 1816#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1817#L12-2 assume !!(main_~c~0 > 0); 1827#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1824#L12-2 assume !!(main_~c~0 > 0); 1820#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-19 22:20:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-19 22:20:46,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:46,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765780732] [2019-11-19 22:20:46,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-19 22:20:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:46,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600580516] [2019-11-19 22:20:46,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-19 22:20:46,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:46,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183294415] [2019-11-19 22:20:46,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:46,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:46,651 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:46,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:46,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:46,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:46,652 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:46,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:46,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:46,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-19 22:20:46,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:46,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:46,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:46,732 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:46,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:46,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:46,741 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:46,747 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:46,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:46,763 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:46,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:46,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:46,765 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:46,765 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:46,765 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:46,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:46,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:46,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-19 22:20:46,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:46,766 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:46,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:46,954 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:46,955 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:46,963 INFO L120 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 [2019-11-19 22:20:46,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:46,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:46,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:46,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:46,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:46,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:46,977 INFO L120 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 [2019-11-19 22:20:46,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:46,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:46,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:46,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:46,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:46,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:46,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:46,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:46,988 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:46,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:46,993 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:46,993 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:46,993 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:46,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:47,057 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 [2019-11-19 22:20:47,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:20:47,063 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. [2019-11-19 22:20:47,064 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 [2019-11-19 22:20:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:47,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-19 22:20:47,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,065 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:47,131 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 [2019-11-19 22:20:47,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:20:47,136 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. [2019-11-19 22:20:47,136 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 [2019-11-19 22:20:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:47,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-19 22:20:47,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,137 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:47,198 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 [2019-11-19 22:20:47,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:20:47,208 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. [2019-11-19 22:20:47,209 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 [2019-11-19 22:20:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-19 22:20:47,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-19 22:20:47,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,210 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:47,271 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 [2019-11-19 22:20:47,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:20:47,327 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. [2019-11-19 22:20:47,328 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 [2019-11-19 22:20:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-19 22:20:47,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-19 22:20:47,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,329 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:47,414 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 [2019-11-19 22:20:47,414 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:20:47,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:47,526 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 [2019-11-19 22:20:47,527 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 [2019-11-19 22:20:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:20:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-19 22:20:47,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-19 22:20:47,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-19 22:20:47,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-19 22:20:47,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:47,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-19 22:20:47,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-19 22:20:47,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-19 22:20:47,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-19 22:20:47,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:20:47,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-19 22:20:47,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:47,540 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-19 22:20:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-19 22:20:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-19 22:20:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-19 22:20:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-19 22:20:47,548 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-19 22:20:47,548 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-19 22:20:47,548 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:20:47,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-19 22:20:47,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-19 22:20:47,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:47,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:47,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-19 22:20:47,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-19 22:20:47,550 INFO L794 eck$LassoCheckResult]: Stem: 2806#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; 2809#L12-2 assume !!(main_~c~0 > 0); 2833#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2829#L12-2 assume !!(main_~c~0 > 0); 2815#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-19 22:20:47,550 INFO L796 eck$LassoCheckResult]: Loop: 2802#L12-2 assume !!(main_~c~0 > 0); 2803#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2864#L12-2 assume !!(main_~c~0 > 0); 2857#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2855#L12-2 assume !!(main_~c~0 > 0); 2849#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2848#L12-2 assume !!(main_~c~0 > 0); 2847#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2839#L12-2 assume !!(main_~c~0 > 0); 2818#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2830#L12-2 assume !!(main_~c~0 > 0); 2828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2826#L12-2 assume !!(main_~c~0 > 0); 2814#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-19 22:20:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-19 22:20:47,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:47,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407141246] [2019-11-19 22:20:47,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-19 22:20:47,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:47,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750024314] [2019-11-19 22:20:47,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-19 22:20:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:47,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069641846] [2019-11-19 22:20:47,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:47,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:47,761 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-19 22:20:47,775 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:47,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:47,775 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:47,775 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:47,775 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:47,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:47,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:47,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-19 22:20:47,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:47,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:47,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,848 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:47,849 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:47,853 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:47,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:47,864 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:47,866 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:47,866 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:47,866 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:47,866 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:47,867 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:47,867 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,867 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:47,867 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:47,867 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-19 22:20:47,868 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:47,868 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:47,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:47,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:47,953 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,963 INFO L120 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 [2019-11-19 22:20:47,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:47,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:47,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:47,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:47,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:47,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:47,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:47,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:47,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:47,974 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:47,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:47,978 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:47,978 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:47,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-19 22:20:47,980 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:47,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:47,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:48,082 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 [2019-11-19 22:20:48,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-19 22:20:48,089 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. [2019-11-19 22:20:48,090 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 [2019-11-19 22:20:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:20:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:48,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-19 22:20:48,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,091 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:48,204 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 [2019-11-19 22:20:48,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-19 22:20:48,211 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. [2019-11-19 22:20:48,211 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 [2019-11-19 22:20:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:20:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:48,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-19 22:20:48,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,212 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:48,312 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 [2019-11-19 22:20:48,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-19 22:20:48,318 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. [2019-11-19 22:20:48,319 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 [2019-11-19 22:20:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:20:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-19 22:20:48,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-19 22:20:48,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,320 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:48,417 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 [2019-11-19 22:20:48,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-19 22:20:48,453 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. [2019-11-19 22:20:48,453 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 [2019-11-19 22:20:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:20:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-19 22:20:48,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-19 22:20:48,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,455 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:48,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:20:48,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:48,573 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 [2019-11-19 22:20:48,573 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-19 22:20:48,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,644 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,648 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,648 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,711 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,712 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,712 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,714 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,714 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,718 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,718 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,719 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,719 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,720 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,720 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,721 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,721 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,774 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,774 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,775 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,775 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,775 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-19 22:20:48,823 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 [2019-11-19 22:20:48,824 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 [2019-11-19 22:20:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:20:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-19 22:20:48,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-19 22:20:48,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-19 22:20:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-19 22:20:48,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:48,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-19 22:20:48,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-19 22:20:48,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-19 22:20:48,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:20:48,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-19 22:20:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-19 22:20:48,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:48,859 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-19 22:20:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-19 22:20:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-19 22:20:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-19 22:20:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-19 22:20:48,875 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-19 22:20:48,876 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-19 22:20:48,876 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 22:20:48,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-19 22:20:48,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-19 22:20:48,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:48,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:48,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-19 22:20:48,880 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-19 22:20:48,880 INFO L794 eck$LassoCheckResult]: Stem: 5719#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; 5724#L12-2 assume !!(main_~c~0 > 0); 5765#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5737#L12-2 assume !!(main_~c~0 > 0); 5733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-19 22:20:48,880 INFO L796 eck$LassoCheckResult]: Loop: 5715#L12-2 assume !!(main_~c~0 > 0); 5716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5934#L12-2 assume !!(main_~c~0 > 0); 5861#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5859#L12-2 assume !!(main_~c~0 > 0); 5857#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5855#L12-2 assume !!(main_~c~0 > 0); 5852#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5841#L12-2 assume !!(main_~c~0 > 0); 5842#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5824#L12-2 assume !!(main_~c~0 > 0); 5825#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5816#L12-2 assume !!(main_~c~0 > 0); 5736#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5759#L12-2 assume !!(main_~c~0 > 0); 5738#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5735#L12-2 assume !!(main_~c~0 > 0); 5732#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-19 22:20:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-19 22:20:48,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:48,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338471967] [2019-11-19 22:20:48,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-19 22:20:48,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:48,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685146977] [2019-11-19 22:20:48,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-19 22:20:48,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:48,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325920035] [2019-11-19 22:20:48,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:48,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:49,124 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-19 22:20:49,136 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:49,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:49,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:49,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:49,137 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:49,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:49,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:49,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-19 22:20:49,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:49,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:49,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,206 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:49,207 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:49,213 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:49,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:49,265 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:49,266 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:49,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:49,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:49,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:49,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:49,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:49,267 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:49,267 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-19 22:20:49,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:49,267 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:49,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:49,334 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:49,334 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,339 INFO L120 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 [2019-11-19 22:20:49,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:49,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:49,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:49,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:49,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:49,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:49,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:49,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:49,345 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:20:49,346 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:49,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:49,350 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:49,350 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:49,350 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-19 22:20:49,352 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:20:49,436 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 [2019-11-19 22:20:49,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-19 22:20:49,444 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. [2019-11-19 22:20:49,445 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 [2019-11-19 22:20:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-19 22:20:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,446 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:20:49,531 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 [2019-11-19 22:20:49,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-19 22:20:49,540 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. [2019-11-19 22:20:49,541 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 [2019-11-19 22:20:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-19 22:20:49,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-19 22:20:49,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,542 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:20:49,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 6 loop predicates [2019-11-19 22:20:49,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-19 22:20:49,651 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. [2019-11-19 22:20:49,651 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 [2019-11-19 22:20:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-19 22:20:49,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-19 22:20:49,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,652 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:20:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:49,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:20:49,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:20:49,745 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 [2019-11-19 22:20:49,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-19 22:20:49,804 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. [2019-11-19 22:20:49,805 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 [2019-11-19 22:20:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-19 22:20:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-19 22:20:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-19 22:20:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-19 22:20:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:49,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-11-19 22:20:49,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:20:49,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-11-19 22:20:49,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:20:49,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:20:49,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:20:49,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:20:49,815 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:20:49,815 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:20:49,815 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:20:49,815 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 22:20:49,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:20:49,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:20:49,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:20:49,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:20:49 BoogieIcfgContainer [2019-11-19 22:20:49,830 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:20:49,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:20:49,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:20:49,831 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:20:49,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:40" (3/4) ... [2019-11-19 22:20:49,837 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:20:49,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:20:49,839 INFO L168 Benchmark]: Toolchain (without parser) took 9955.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -237.6 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:20:49,842 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:20:49,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.50 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:20:49,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:20:49,846 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:20:49,847 INFO L168 Benchmark]: RCFGBuilder took 213.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:20:49,848 INFO L168 Benchmark]: BuchiAutomizer took 9358.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:20:49,848 INFO L168 Benchmark]: Witness Printer took 6.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:20:49,857 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.50 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9358.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.4s. Construction of modules took 0.4s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 393 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: 154 SDtfs, 161 SDslu, 64 SDs, 0 SdLazy, 353 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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 smp96 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...