./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.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-91b1670 [2018-11-28 23:16:12,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:16:12,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:16:12,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:16:12,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:16:12,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:16:12,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:16:12,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:16:12,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:16:12,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:16:12,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:16:12,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:16:12,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:16:12,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:16:12,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:16:12,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:16:12,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:16:12,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:16:12,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:16:12,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:16:12,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:16:12,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:16:12,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:16:12,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:16:12,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:16:12,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:16:12,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:16:12,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:16:12,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:16:12,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:16:12,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:16:12,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:16:12,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:16:12,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:16:12,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:16:12,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:16:12,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:16:12,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:16:12,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:16:12,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:16:12,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:16:12,202 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:16:12,202 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:16:12,202 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:16:12,202 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:16:12,203 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:16:12,203 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:16:12,203 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:16:12,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:16:12,203 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:16:12,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:16:12,204 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:16:12,205 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:16:12,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:16:12,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:16:12,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:16:12,205 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:16:12,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:16:12,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:16:12,206 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:16:12,207 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:16:12,207 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2018-11-28 23:16:12,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:16:12,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:16:12,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:16:12,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:16:12,278 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:16:12,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 23:16:12,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6122751/f053edf4578342a784f4bb489b7b90ac/FLAGbf5c6818f [2018-11-28 23:16:12,832 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:16:12,833 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 23:16:12,840 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6122751/f053edf4578342a784f4bb489b7b90ac/FLAGbf5c6818f [2018-11-28 23:16:13,157 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6122751/f053edf4578342a784f4bb489b7b90ac [2018-11-28 23:16:13,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:16:13,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:16:13,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:16:13,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:16:13,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:16:13,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebc4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13, skipping insertion in model container [2018-11-28 23:16:13,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:16:13,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:16:13,407 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:16:13,411 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:16:13,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:16:13,439 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:16:13,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13 WrapperNode [2018-11-28 23:16:13,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:16:13,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:16:13,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:16:13,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:16:13,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:16:13,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:16:13,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:16:13,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:16:13,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... [2018-11-28 23:16:13,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:16:13,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:16:13,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:16:13,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:16:13,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:16:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:16:13,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:16:13,763 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:16:13,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:13 BoogieIcfgContainer [2018-11-28 23:16:13,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:16:13,764 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:16:13,764 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:16:13,769 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:16:13,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:16:13,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:16:13" (1/3) ... [2018-11-28 23:16:13,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638f9593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:13, skipping insertion in model container [2018-11-28 23:16:13,771 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:16:13,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:13" (2/3) ... [2018-11-28 23:16:13,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638f9593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:13, skipping insertion in model container [2018-11-28 23:16:13,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:16:13,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:13" (3/3) ... [2018-11-28 23:16:13,774 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-11-28 23:16:13,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:16:13,826 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:16:13,826 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:16:13,826 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:16:13,826 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:16:13,826 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:16:13,827 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:16:13,827 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:16:13,827 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:16:13,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:16:13,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:13,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:13,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:13,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:16:13,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:13,865 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:16:13,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:16:13,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:13,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:13,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:13,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:16:13,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:13,875 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2018-11-28 23:16:13,875 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2018-11-28 23:16:13,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:16:13,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:13,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:13,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 23:16:13,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:13,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:13,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:13,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 23:16:13,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:13,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:14,150 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:16:14,252 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:14,253 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:14,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:14,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:14,254 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:14,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:14,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:14,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:14,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:16:14,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:14,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:14,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:14,548 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:14,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:14,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:14,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:14,588 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:14,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:14,594 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:14,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:14,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:14,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:14,621 INFO L163 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 [2018-11-28 23:16:14,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:14,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:14,674 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:14,676 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:14,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:14,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:14,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:14,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:14,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:14,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:14,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:14,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:16:14,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:14,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:14,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:15,082 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:15,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:15,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:15,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:15,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:15,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:15,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:15,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:15,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:15,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:15,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:15,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:15,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:15,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:15,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:15,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:15,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:15,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:15,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:15,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:15,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:15,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:15,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:15,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:15,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:15,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:15,129 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:15,129 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:15,131 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:15,131 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:15,131 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:15,132 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:16:15,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:15,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:15,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:15,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:15,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:16:15,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-28 23:16:15,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-28 23:16:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:16:15,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:16:15,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:16:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:16:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:15,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 23:16:15,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:15,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-28 23:16:15,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:16:15,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 23:16:15,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 23:16:15,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:15,353 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:16:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 23:16:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:16:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:16:15,377 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:16:15,377 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:16:15,377 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:16:15,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 23:16:15,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:15,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:15,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:15,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:16:15,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:15,379 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2018-11-28 23:16:15,379 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2018-11-28 23:16:15,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:16:15,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 23:16:15,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-11-28 23:16:15,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:15,528 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:15,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:15,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:15,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:15,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:15,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:15,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:15,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:15,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:16:15,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:15,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:15,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:15,660 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:15,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:15,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:15,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:15,704 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:15,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:15,710 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:15,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:15,738 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:15,764 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:15,765 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:15,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:15,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:15,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:15,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:15,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:15,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:15,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:15,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:16:15,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:15,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:15,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:15,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,260 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:16,260 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:16,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:16,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:16,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:16,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:16,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:16,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:16,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:16,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:16,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:16,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:16,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:16,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:16,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:16,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:16,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:16,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:16,289 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:16,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:16,293 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:16,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:16,294 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:16,294 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:16,294 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:16:16,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:16,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:16,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:16,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:16,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:16:16,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:16:16,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-28 23:16:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:16:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:16:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:16,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:16:16,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:16,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:16:16,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:16,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-28 23:16:16,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:16,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:16:16,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:16:16,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:16:16,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 23:16:16,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:16,470 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:16:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 23:16:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:16:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:16:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:16:16,472 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:16:16,472 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:16:16,473 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:16:16,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 23:16:16,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:16:16,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:16,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:16,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:16:16,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:16,474 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2018-11-28 23:16:16,474 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2018-11-28 23:16:16,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-11-28 23:16:16,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:16,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:16,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 23:16:16,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:16,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:16,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-11-28 23:16:16,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:16,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:16,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:16,552 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:16,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:16,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:16,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:16,552 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:16,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:16,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:16,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:16,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:16:16,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:16,553 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:16,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,682 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:16,683 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:16,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:16,686 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:16,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:16,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:16,733 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:16,735 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:16,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:16,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:16,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:16,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:16,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:16,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:16,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:16,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:16:16,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:16,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:16,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:16,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:16,873 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:16,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:16,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:16,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:16,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:16,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:16,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:16,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:16,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:16,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:16,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:16,886 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:16,886 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:16,886 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:16,886 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:16,887 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:16:16,887 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:16,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:16,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:16,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:16,933 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:16:16,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:16:16,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:16:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:16:16,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:16:16,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:16,950 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:16,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:17,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:16:17,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:16:17,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:16:17,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:16:17,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:16:17,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,035 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:17,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:17,083 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:16:17,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:16:17,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2018-11-28 23:16:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:16:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:16:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:16:17,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:16:17,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-11-28 23:16:17,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:16:17,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-11-28 23:16:17,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:16:17,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:16:17,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 23:16:17,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:17,111 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:16:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 23:16:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-11-28 23:16:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:16:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-28 23:16:17,112 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:16:17,114 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:16:17,114 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:16:17,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-11-28 23:16:17,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:16:17,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:17,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:17,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:16:17,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:17,116 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2018-11-28 23:16:17,116 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2018-11-28 23:16:17,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 23:16:17,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:17,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-11-28 23:16:17,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-28 23:16:17,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,196 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:17,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:17,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:17,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:17,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:17,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:17,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:17,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:16:17,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:17,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:17,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,356 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:17,356 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:17,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:17,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:17,387 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:17,399 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:17,423 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:17,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:17,432 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:17,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:17,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:17,478 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:17,483 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:17,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:17,527 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:17,528 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:17,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:17,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:17,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:17,529 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:17,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:17,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:17,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:16:17,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:17,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,623 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:17,624 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:17,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:17,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:17,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:17,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:17,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:17,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:17,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:17,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:17,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:17,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:17,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:17,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:17,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:17,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:17,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:17,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:17,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:17,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:17,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:17,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:17,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:17,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:17,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:17,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:17,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:17,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:17,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:17,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:17,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:17,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:17,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:17,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:17,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:17,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:17,663 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:17,664 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:16:17,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:17,664 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:17,664 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:17,664 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-28 23:16:17,666 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:17,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:17,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:16:17,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:16:17,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2018-11-28 23:16:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-11-28 23:16:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:16:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:16:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:16:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:17,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-11-28 23:16:17,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:16:17,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-11-28 23:16:17,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:16:17,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 23:16:17,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-11-28 23:16:17,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:17,744 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-28 23:16:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-11-28 23:16:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:16:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:16:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-11-28 23:16:17,746 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:16:17,746 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:16:17,746 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:16:17,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-11-28 23:16:17,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:16:17,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:17,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:17,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-11-28 23:16:17,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:16:17,750 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-11-28 23:16:17,750 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2018-11-28 23:16:17,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-11-28 23:16:17,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:16:17,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:16:17,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:16:17,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-11-28 23:16:17,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:17,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:17,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:17,839 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:17,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:17,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:17,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:17,839 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:17,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:17,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:17,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:16:17,840 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:17,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:17,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:17,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:17,958 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:17,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:17,968 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:16:18,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:18,010 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:18,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:18,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}] Lambdas: [3, 12, 1] Nus: [0, 0] No working directory specified, using /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 [2018-11-28 23:16:18,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:18,069 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:18,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:18,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:18,128 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:18,130 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:18,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:18,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:18,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:18,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:18,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:18,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:18,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:18,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:16:18,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:18,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:18,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:18,265 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:18,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:18,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:18,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:18,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:18,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:18,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:18,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:18,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:18,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:18,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:18,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:18,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:18,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:18,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:18,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:18,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:18,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:18,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:18,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:18,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:18,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:18,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:18,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:18,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:18,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:18,282 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:18,284 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:18,284 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:16:18,285 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:18,285 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:18,285 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:18,285 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-28 23:16:18,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:18,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:18,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:16:18,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:16:18,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2018-11-28 23:16:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 23:16:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:16:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:18,393 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:18,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:16:18,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:16:18,557 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-11-28 23:16:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:16:18,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:18,558 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:18,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:18,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:18,667 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:16:18,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:16:18,676 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-11-28 23:16:18,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:16:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:16:18,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:16:18,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:18,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:16:18,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:18,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:16:18,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:18,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 23:16:18,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:16:18,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-11-28 23:16:18,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:16:18,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:16:18,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 23:16:18,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:18,681 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:16:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 23:16:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-11-28 23:16:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:16:18,683 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:16:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:16:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:16:18,687 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-11-28 23:16:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:16:18,709 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-28 23:16:18,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:16:18,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-28 23:16:18,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:16:18,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-11-28 23:16:18,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:16:18,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:16:18,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 23:16:18,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:18,713 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:16:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 23:16:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-11-28 23:16:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 23:16:18,717 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:16:18,717 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:16:18,717 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:16:18,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-28 23:16:18,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:16:18,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:18,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:18,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-11-28 23:16:18,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:16:18,718 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-11-28 23:16:18,718 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2018-11-28 23:16:18,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-11-28 23:16:18,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:18,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-11-28 23:16:18,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:18,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-11-28 23:16:18,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:18,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:18,848 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:18,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:18,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:18,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:18,848 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:18,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:18,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:18,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:18,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:16:18,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:18,849 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:18,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:18,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:18,956 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:18,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:18,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:18,981 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:18,982 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:18,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:18,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:19,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:19,005 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:19,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:19,009 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:19,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:19,032 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:19,043 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:19,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:19,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:19,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:19,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:19,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:19,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:19,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:19,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:19,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:16:19,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:19,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:19,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:19,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:19,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:19,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:19,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:19,161 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:19,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:19,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:19,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:19,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:19,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:19,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:19,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:19,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:19,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:19,174 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:19,174 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:16:19,175 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:19,175 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:19,175 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:19,175 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2018-11-28 23:16:19,175 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:19,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:19,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:19,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:16:19,312 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2018-11-28 23:16:19,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:16:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 23:16:19,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:16:19,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,315 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:19,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:19,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:19,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:16:19,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2018-11-28 23:16:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:16:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:19,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:16:19,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,506 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:19,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:19,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:19,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:16:19,596 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2018-11-28 23:16:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:16:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:16:19,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:16:19,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,598 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:19,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:19,700 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:19,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:16:19,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2018-11-28 23:16:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:16:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:16:19,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:16:19,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,777 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:19,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:19,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:19,874 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:19,876 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:16:19,964 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2018-11-28 23:16:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:16:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:16:19,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:16:19,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:16:19,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:16:19,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:19,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-11-28 23:16:19,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:16:19,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-11-28 23:16:19,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:16:19,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 23:16:19,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-11-28 23:16:19,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:19,977 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-11-28 23:16:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-11-28 23:16:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-11-28 23:16:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:16:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-11-28 23:16:19,980 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 23:16:19,980 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 23:16:19,980 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:16:19,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-11-28 23:16:19,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:16:19,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:19,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:19,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-11-28 23:16:19,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 23:16:19,982 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-11-28 23:16:19,982 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2018-11-28 23:16:19,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-11-28 23:16:19,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:19,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:16:20,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:16:20,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:16:20,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:16:20,105 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-28 23:16:20,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:16:20,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:16:20,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:16:20,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 23:16:20,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:16:20,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-11-28 23:16:20,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:20,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:20,527 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-28 23:16:20,542 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:20,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:20,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:20,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:20,542 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:20,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:20,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:20,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:16:20,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:20,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:20,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,622 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:20,622 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:20,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:20,648 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:20,648 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:20,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:20,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:20,672 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:20,678 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:20,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:20,754 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:20,755 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:20,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:20,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:20,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:20,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:20,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:20,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:20,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:20,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:16:20,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:20,756 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:20,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:20,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:20,829 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:20,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:20,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:20,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:20,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:20,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:20,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:20,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:20,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:20,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:20,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:20,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:20,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:20,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:20,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:20,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:20,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:20,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:20,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:20,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:20,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:20,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:20,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:20,857 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:20,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:20,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:20,858 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:20,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:16:20,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:20,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:20,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:20,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:16:20,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:16:20,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 23:16:21,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2018-11-28 23:16:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:16:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 23:16:21,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:16:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:16:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 23:16:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:21,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2018-11-28 23:16:21,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:16:21,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2018-11-28 23:16:21,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:16:21,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:16:21,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2018-11-28 23:16:21,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:21,009 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2018-11-28 23:16:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2018-11-28 23:16:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-11-28 23:16:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:16:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-11-28 23:16:21,015 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-11-28 23:16:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:16:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:16:21,018 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2018-11-28 23:16:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:16:21,041 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-28 23:16:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:16:21,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-28 23:16:21,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:16:21,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2018-11-28 23:16:21,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:16:21,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 23:16:21,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-28 23:16:21,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:21,048 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 23:16:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-28 23:16:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-11-28 23:16:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:16:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 23:16:21,051 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:16:21,051 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:16:21,052 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:16:21,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 23:16:21,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:16:21,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:21,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:21,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-11-28 23:16:21,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 23:16:21,056 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-11-28 23:16:21,056 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2018-11-28 23:16:21,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-11-28 23:16:21,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:21,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:21,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-11-28 23:16:21,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:21,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-11-28 23:16:21,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:16:21,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:16:21,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:16:21,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:21,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:16:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:16:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:16:21,365 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:21,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:21,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:21,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:21,366 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:21,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:21,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:21,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:21,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:16:21,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:21,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:21,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:21,486 INFO L412 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:21,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:21,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:21,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:21,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:21,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:21,515 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:16:21,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:21,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:21,542 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:21,560 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:21,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:21,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:21,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:21,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:21,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:21,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:21,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:21,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:16:21,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:21,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:21,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:21,630 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:21,631 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:21,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:21,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:21,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:21,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:21,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:21,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:21,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:21,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:21,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:21,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:21,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:21,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:21,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:21,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:21,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:21,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:21,647 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:21,650 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:21,650 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:21,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:21,651 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:21,651 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:21,651 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:16:21,651 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:21,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:21,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:21,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:22,004 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:16:22,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:16:22,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-11-28 23:16:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:16:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:16:22,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:16:22,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:22,041 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:22,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:22,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:22,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:16:22,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:16:22,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2018-11-28 23:16:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:16:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:16:22,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:16:22,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:22,131 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:22,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:22,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:22,206 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:16:22,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:16:22,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2018-11-28 23:16:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:16:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:16:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:16:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-28 23:16:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-11-28 23:16:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:22,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-11-28 23:16:22,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-28 23:16:22,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-11-28 23:16:22,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:16:22,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:16:22,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-11-28 23:16:22,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:22,285 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-28 23:16:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-11-28 23:16:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-11-28 23:16:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:16:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-11-28 23:16:22,290 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-11-28 23:16:22,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:16:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:16:22,290 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-11-28 23:16:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:16:22,324 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-11-28 23:16:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:16:22,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-11-28 23:16:22,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 23:16:22,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-11-28 23:16:22,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:16:22,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:16:22,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-11-28 23:16:22,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:22,331 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-11-28 23:16:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-11-28 23:16:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-11-28 23:16:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:16:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-11-28 23:16:22,335 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:16:22,335 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:16:22,335 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:16:22,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-11-28 23:16:22,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:16:22,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:22,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:22,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:16:22,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-11-28 23:16:22,336 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1623#L12-2 assume !!(main_~c~0 > 0); 1637#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1632#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-11-28 23:16:22,337 INFO L796 eck$LassoCheckResult]: Loop: 1629#L12-2 assume !!(main_~c~0 > 0); 1626#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1627#L12-2 assume !!(main_~c~0 > 0); 1631#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1617#L12-2 assume !!(main_~c~0 > 0); 1618#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1624#L12-2 assume !!(main_~c~0 > 0); 1628#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1629#L12-2 [2018-11-28 23:16:22,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-11-28 23:16:22,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-11-28 23:16:22,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:22,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:22,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:22,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:16:22,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:16:22,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:16:22,443 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:16:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:16:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:16:22,443 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 23:16:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:16:22,456 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-28 23:16:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:16:22,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-11-28 23:16:22,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:16:22,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-11-28 23:16:22,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:16:22,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:16:22,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-28 23:16:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:22,460 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-28 23:16:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-28 23:16:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-28 23:16:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:16:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-28 23:16:22,463 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:16:22,463 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:16:22,463 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:16:22,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-11-28 23:16:22,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:16:22,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:22,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:22,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:16:22,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-11-28 23:16:22,465 INFO L794 eck$LassoCheckResult]: Stem: 1712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1714#L12-2 assume !!(main_~c~0 > 0); 1728#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1723#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-11-28 23:16:22,465 INFO L796 eck$LassoCheckResult]: Loop: 1708#L12-2 assume !!(main_~c~0 > 0); 1709#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1718#L12-2 assume !!(main_~c~0 > 0); 1724#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1722#L12-2 assume !!(main_~c~0 > 0); 1715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1716#L12-2 assume !!(main_~c~0 > 0); 1727#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1725#L12-2 assume !!(main_~c~0 > 0); 1721#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1708#L12-2 [2018-11-28 23:16:22,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-11-28 23:16:22,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:22,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-11-28 23:16:22,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:22,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:22,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:22,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-11-28 23:16:22,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:22,644 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-11-28 23:16:22,655 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:22,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:22,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:22,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:22,656 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:22,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:22,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:22,656 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:22,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 23:16:22,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:22,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:22,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:22,728 INFO L412 LassoAnalysis]: Checking for nontermination... 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) [2018-11-28 23:16:22,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:22,739 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:22,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:16:22,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:22,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:22,771 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:16:22,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:22,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:22,815 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:22,816 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:22,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:22,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:22,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:22,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:22,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:22,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:22,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:22,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 23:16:22,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:22,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:22,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:23,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:23,008 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:23,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:23,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:23,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:23,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:23,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:23,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:16:23,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:16:23,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:16:23,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:23,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:23,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:23,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:23,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:23,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:23,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:23,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:23,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:23,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:23,033 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:23,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:23,033 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:23,036 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:23,036 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:16:23,036 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:23,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:23,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:16:23,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:16:23,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:16:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:16:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:23,181 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:23,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:23,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:16:23,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:16:23,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:16:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:23,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:16:23,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:23,528 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:23,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:23,615 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:16:23,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:16:23,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2018-11-28 23:16:23,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 [2018-11-28 23:16:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:16:23,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:16:23,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:23,650 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:23,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:23,718 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:16:23,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:16:23,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2018-11-28 23:16:23,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:16:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:16:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:23,767 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:23,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:23,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:23,907 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:16:23,908 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:16:23,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:23,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:23,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:23,997 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:23,998 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,047 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,048 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,048 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,049 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,049 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,049 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,050 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,052 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:24,066 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2018-11-28 23:16:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:16:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-28 23:16:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:16:24,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:24,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-28 23:16:24,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:24,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-28 23:16:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:24,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-11-28 23:16:24,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 23:16:24,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-11-28 23:16:24,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:16:24,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:16:24,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-11-28 23:16:24,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:24,101 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-11-28 23:16:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-11-28 23:16:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-11-28 23:16:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 23:16:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-11-28 23:16:24,116 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 23:16:24,117 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 23:16:24,118 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:16:24,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-11-28 23:16:24,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-28 23:16:24,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:24,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:24,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:16:24,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-11-28 23:16:24,120 INFO L794 eck$LassoCheckResult]: Stem: 2705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2708#L12-2 assume !!(main_~c~0 > 0); 2733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2725#L12-2 assume !!(main_~c~0 > 0); 2713#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-11-28 23:16:24,120 INFO L796 eck$LassoCheckResult]: Loop: 2701#L12-2 assume !!(main_~c~0 > 0); 2702#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2762#L12-2 assume !!(main_~c~0 > 0); 2756#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2754#L12-2 assume !!(main_~c~0 > 0); 2748#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2747#L12-2 assume !!(main_~c~0 > 0); 2746#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2738#L12-2 assume !!(main_~c~0 > 0); 2717#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2730#L12-2 assume !!(main_~c~0 > 0); 2728#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2727#L12-2 assume !!(main_~c~0 > 0); 2715#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2701#L12-2 [2018-11-28 23:16:24,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-11-28 23:16:24,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:24,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:24,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:24,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,126 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-11-28 23:16:24,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:24,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-11-28 23:16:24,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:24,289 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-11-28 23:16:24,312 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:24,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:24,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:24,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:24,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:24,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:24,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:24,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:24,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-28 23:16:24,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:24,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:24,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,443 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:24,443 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:24,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:24,449 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:24,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:24,472 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:24,475 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:24,493 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:24,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:24,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:24,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:24,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:24,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:24,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:24,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:24,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-28 23:16:24,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:24,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:24,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:24,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:24,600 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:24,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:24,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:24,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:24,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:24,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:24,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:24,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:24,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:24,606 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:24,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:24,608 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:24,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:24,608 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:24,608 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:24,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:16:24,609 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:24,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:24,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:24,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:24,795 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:16:24,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:16:24,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-11-28 23:16:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:16:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:24,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:16:24,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:24,803 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:24,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:24,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:24,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:24,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:16:24,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:16:24,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2018-11-28 23:16:24,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:16:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:16:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:24,977 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:24,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:24,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:25,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:25,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:16:25,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:16:25,085 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2018-11-28 23:16:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:16:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:16:25,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:16:25,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:25,094 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:25,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:25,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:25,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:25,235 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:16:25,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:16:25,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2018-11-28 23:16:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:16:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:16:25,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:16:25,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:25,311 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:25,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:25,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:25,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:16:25,462 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:16:25,462 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:16:25,622 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,623 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,623 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,623 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,623 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,623 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,627 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,628 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,631 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,631 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,634 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,634 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,750 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,751 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,751 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,752 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,752 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,752 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,752 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,752 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,756 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,757 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,757 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,757 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,757 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,757 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,758 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,758 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,766 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,769 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:25,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,087 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,087 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,088 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,089 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,089 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,089 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,089 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,089 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,090 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,090 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,090 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,090 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,090 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,091 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,093 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,094 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,094 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,094 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,094 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,094 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,099 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:16:26,162 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2018-11-28 23:16:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:16:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-11-28 23:16:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:16:26,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-11-28 23:16:26,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:26,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-11-28 23:16:26,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:26,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-11-28 23:16:26,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-28 23:16:26,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-11-28 23:16:26,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:16:26,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:16:26,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-11-28 23:16:26,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:16:26,203 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-11-28 23:16:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-11-28 23:16:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-11-28 23:16:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 23:16:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-11-28 23:16:26,229 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 23:16:26,229 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 23:16:26,229 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:16:26,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-11-28 23:16:26,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 23:16:26,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:16:26,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:16:26,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:16:26,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-11-28 23:16:26,238 INFO L794 eck$LassoCheckResult]: Stem: 5618#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5623#L12-2 assume !!(main_~c~0 > 0); 5681#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5633#L12-2 assume !!(main_~c~0 > 0); 5630#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-11-28 23:16:26,238 INFO L796 eck$LassoCheckResult]: Loop: 5614#L12-2 assume !!(main_~c~0 > 0); 5615#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5831#L12-2 assume !!(main_~c~0 > 0); 5761#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5759#L12-2 assume !!(main_~c~0 > 0); 5757#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5755#L12-2 assume !!(main_~c~0 > 0); 5751#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5752#L12-2 assume !!(main_~c~0 > 0); 5734#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5735#L12-2 assume !!(main_~c~0 > 0); 5731#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5732#L12-2 assume !!(main_~c~0 > 0); 5635#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5657#L12-2 assume !!(main_~c~0 > 0); 5636#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5634#L12-2 assume !!(main_~c~0 > 0); 5632#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5614#L12-2 [2018-11-28 23:16:26,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-11-28 23:16:26,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:16:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-11-28 23:16:26,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:26,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-11-28 23:16:26,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:16:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:16:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:16:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:16:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:16:26,479 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-11-28 23:16:26,493 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:26,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:26,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:26,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:26,493 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:16:26,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:26,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:26,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:26,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 23:16:26,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:26,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:26,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,562 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:26,562 INFO L412 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 [2018-11-28 23:16:26,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:16:26,572 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:16:26,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:16:26,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:16:26,653 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:16:26,654 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:16:26,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:16:26,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:16:26,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:16:26,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:16:26,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:16:26,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:16:26,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:16:26,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 23:16:26,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:16:26,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:16:26,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:16:26,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:16:26,730 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:16:26,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:16:26,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:16:26,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:16:26,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:16:26,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:16:26,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:16:26,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:16:26,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:16:26,736 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:16:26,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:16:26,743 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:16:26,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:16:26,744 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:16:26,744 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:16:26,744 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:16:26,744 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:16:26,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:26,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:26,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:16:26,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:16:26,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 23:16:26,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-11-28 23:16:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:16:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:26,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:16:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:26,850 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:27,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:16:27,367 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:16:27,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 23:16:27,388 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2018-11-28 23:16:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:16:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:16:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:16:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:27,390 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:27,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:16:27,489 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:16:27,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 23:16:27,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2018-11-28 23:16:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:16:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:16:27,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:16:27,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:27,558 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:16:27,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:16:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:16:27,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:16:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:16:27,794 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:16:27,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2018-11-28 23:16:27,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2018-11-28 23:16:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:16:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:16:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-28 23:16:27,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:16:27,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:27,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-28 23:16:27,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:27,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-28 23:16:27,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:16:27,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2018-11-28 23:16:27,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:16:27,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2018-11-28 23:16:27,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:16:27,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:16:27,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:16:27,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:16:27,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:16:27,941 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:16:27,941 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:16:27,941 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:16:27,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:16:27,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:16:27,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:16:27,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:16:27 BoogieIcfgContainer [2018-11-28 23:16:27,957 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:16:27,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:16:27,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:16:27,958 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:16:27,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:13" (3/4) ... [2018-11-28 23:16:27,965 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:16:27,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:16:27,967 INFO L168 Benchmark]: Toolchain (without parser) took 14803.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 946.0 MB in the beginning and 859.3 MB in the end (delta: 86.7 MB). Peak memory consumption was 380.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:16:27,968 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:16:27,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.61 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:16:27,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.30 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:16:27,970 INFO L168 Benchmark]: Boogie Preprocessor took 17.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:16:27,972 INFO L168 Benchmark]: RCFGBuilder took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:16:27,973 INFO L168 Benchmark]: BuchiAutomizer took 14192.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 859.3 MB in the end (delta: 268.0 MB). Peak memory consumption was 421.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:16:27,975 INFO L168 Benchmark]: Witness Printer took 7.15 ms. Allocated memory is still 1.3 GB. Free memory is still 859.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:16:27,980 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.61 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 34.30 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14192.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 859.3 MB in the end (delta: 268.0 MB). Peak memory consumption was 421.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.15 ms. Allocated memory is still 1.3 GB. Free memory is still 859.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 7.4s. Construction of modules took 0.9s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 335 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 159 SDtfs, 158 SDslu, 75 SDs, 0 SdLazy, 277 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...