./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 2e94e6aa 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-2e94e6a [2019-01-01 21:36:56,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:36:56,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:36:56,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:36:56,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:36:56,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:36:56,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:36:56,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:36:56,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:36:56,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:36:56,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:36:56,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:36:56,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:36:56,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:36:56,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:36:56,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:36:56,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:36:56,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:36:56,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:36:56,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:36:56,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:36:56,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:36:56,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:36:56,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:36:56,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:36:56,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:36:56,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:36:56,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:36:56,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:36:56,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:36:56,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:36:56,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:36:56,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:36:56,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:36:56,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:36:56,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:36:56,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:36:56,919 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:36:56,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:36:56,920 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:36:56,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:36:56,921 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:36:56,921 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:36:56,921 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:36:56,921 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:36:56,922 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:36:56,922 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:36:56,922 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:36:56,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:36:56,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:36:56,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:36:56,923 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:36:56,924 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:36:56,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:36:56,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:36:56,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:36:56,924 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:36:56,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:36:56,925 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:36:56,925 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:36:56,926 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:36:56,926 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 [2019-01-01 21:36:56,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:36:56,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:36:56,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:36:56,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:36:56,994 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:36:56,996 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2019-01-01 21:36:57,083 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5204afe/21e23a370fc84dfe978e493f9adf157d/FLAGec1383e64 [2019-01-01 21:36:57,624 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:36:57,625 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2019-01-01 21:36:57,632 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5204afe/21e23a370fc84dfe978e493f9adf157d/FLAGec1383e64 [2019-01-01 21:36:57,981 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5204afe/21e23a370fc84dfe978e493f9adf157d [2019-01-01 21:36:57,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:36:57,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:36:57,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:57,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:36:57,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:36:57,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:57" (1/1) ... [2019-01-01 21:36:58,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cc0ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58, skipping insertion in model container [2019-01-01 21:36:58,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:57" (1/1) ... [2019-01-01 21:36:58,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:36:58,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:36:58,221 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:58,226 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:36:58,244 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:58,261 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:36:58,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58 WrapperNode [2019-01-01 21:36:58,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:58,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:58,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:36:58,263 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:36:58,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:58,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:36:58,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:36:58,303 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:36:58,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... [2019-01-01 21:36:58,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:36:58,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:36:58,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:36:58,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:36:58,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:36:58,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:36:58,670 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:36:58,670 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:36:58,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:58 BoogieIcfgContainer [2019-01-01 21:36:58,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:36:58,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:36:58,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:36:58,676 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:36:58,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:58,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:36:57" (1/3) ... [2019-01-01 21:36:58,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bef2cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:58, skipping insertion in model container [2019-01-01 21:36:58,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:58,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:58" (2/3) ... [2019-01-01 21:36:58,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bef2cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:58, skipping insertion in model container [2019-01-01 21:36:58,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:58,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:58" (3/3) ... [2019-01-01 21:36:58,682 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2019-01-01 21:36:58,748 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:36:58,749 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:36:58,749 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:36:58,749 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:36:58,749 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:36:58,750 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:36:58,750 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:36:58,750 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:36:58,750 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:36:58,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:36:58,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:36:58,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:58,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:58,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:58,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:36:58,802 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:36:58,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:36:58,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:36:58,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:58,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:58,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:58,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:36:58,815 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2019-01-01 21:36:58,816 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2019-01-01 21:36:58,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:36:58,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:36:58,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:58,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:36:58,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:59,136 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:36:59,226 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:59,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:59,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:59,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:59,228 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:59,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:59,228 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:59,228 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:59,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:59,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:59,230 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:59,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:59,617 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) [2019-01-01 21:36:59,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:59,625 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:59,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:59,655 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 [2019-01-01 21:36:59,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:59,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:59,686 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:59,686 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 [2019-01-01 21:36:59,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:59,693 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 [2019-01-01 21:36:59,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:59,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:59,745 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:59,747 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:59,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:59,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:59,748 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:59,748 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:59,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:59,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:59,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:59,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:59,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:59,749 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:59,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:59,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:00,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:00,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:00,186 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 [2019-01-01 21:37:00,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:00,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:00,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:00,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:00,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:00,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:00,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:00,204 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 [2019-01-01 21:37:00,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:00,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:00,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:00,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:00,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:00,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:00,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:00,220 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 [2019-01-01 21:37:00,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:00,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:00,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:00,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:00,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:00,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:00,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:00,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:00,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:00,239 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:00,241 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:00,241 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:00,242 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:00,242 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:00,244 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:00,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:00,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:00,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:00,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:37:00,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-01 21:37:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:37:00,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:37:00,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:37:00,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:00,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:37:00,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:00,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:37:00,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:00,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:37:00,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:37:00,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:00,522 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:37:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:37:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:37:00,563 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:00,564 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:00,564 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:37:00,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:37:00,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:00,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:00,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:00,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:37:00,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:00,569 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2019-01-01 21:37:00,569 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2019-01-01 21:37:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:37:00,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:00,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:37:00,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-01 21:37:00,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:00,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:00,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:00,769 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:00,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:00,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:00,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:00,770 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:00,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:00,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:00,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:00,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:00,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:00,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:00,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:00,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:00,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:00,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:00,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:00,960 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 [2019-01-01 21:37:00,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:00,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:01,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:01,006 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 [2019-01-01 21:37:01,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:01,013 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 [2019-01-01 21:37:01,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:01,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:01,073 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:01,076 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:01,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:01,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:01,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:01,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:01,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:01,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:01,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:01,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:01,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:01,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:01,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:01,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:01,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:01,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:01,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:01,681 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:01,682 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 [2019-01-01 21:37:01,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:01,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:01,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:01,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:01,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:01,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:01,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:01,702 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 [2019-01-01 21:37:01,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:01,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:01,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:01,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:01,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:01,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:01,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:01,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:01,723 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:01,724 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:01,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:01,724 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:01,725 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:01,725 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:37:01,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:01,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:01,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:01,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:01,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:37:01,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:37:01,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:37:01,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:01,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:01,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:37:01,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:01,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:37:01,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:01,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:37:01,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:01,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:37:01,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:37:01,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:37:01,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:37:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:01,899 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:37:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:37:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:37:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:37:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:37:01,901 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:37:01,901 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:37:01,902 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:37:01,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-01 21:37:01,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:01,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:01,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:01,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:37:01,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:01,904 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2019-01-01 21:37:01,904 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2019-01-01 21:37:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-01 21:37:01,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:01,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-01 21:37:01,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:01,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:01,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:01,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-01 21:37:01,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:01,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:01,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:01,994 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:01,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:01,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:01,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:01,995 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:01,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:01,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:01,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:01,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:01,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:01,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:01,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,169 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:02,169 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 [2019-01-01 21:37:02,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:02,173 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 [2019-01-01 21:37:02,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:02,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:02,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:02,223 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:02,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:02,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:02,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:02,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:02,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:02,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:02,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:02,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:02,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:02,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:02,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:02,371 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:02,371 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 [2019-01-01 21:37:02,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:02,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:02,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:02,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:02,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:02,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:02,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:02,382 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:02,386 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:02,387 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:02,387 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:02,387 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:02,387 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:02,388 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:02,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:02,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:02,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:37:02,446 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:37:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:37:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:37:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,450 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:02,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:02,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:37:02,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:37:02,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 [2019-01-01 21:37:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:37:02,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:37:02,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,558 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:02,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:02,608 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:02,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:37:02,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-01 21:37:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:37:02,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:37:02,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:37:02,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:37:02,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:02,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-01 21:37:02,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:37:02,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-01 21:37:02,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:37:02,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:37:02,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:37:02,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:02,640 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:37:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:37:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-01 21:37:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-01 21:37:02,643 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:37:02,644 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:37:02,644 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:37:02,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-01 21:37:02,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:37:02,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:02,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:02,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:02,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:02,647 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2019-01-01 21:37:02,647 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2019-01-01 21:37:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:37:02,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-01 21:37:02,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-01 21:37:02,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:02,742 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:02,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:02,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:02,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:02,743 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:02,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:02,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:02,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:02,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:37:02,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:02,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:02,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:02,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:02,925 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 [2019-01-01 21:37:02,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:02,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:02,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:02,956 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 [2019-01-01 21:37:02,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:02,963 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 [2019-01-01 21:37:02,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:02,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:02,998 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:02,999 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 [2019-01-01 21:37:03,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:03,043 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 [2019-01-01 21:37:03,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,048 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 [2019-01-01 21:37:03,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:03,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,098 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:03,100 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:03,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:37:03,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,217 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:03,218 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 [2019-01-01 21:37:03,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,225 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 [2019-01-01 21:37:03,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,233 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 [2019-01-01 21:37:03,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,240 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 [2019-01-01 21:37:03,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:03,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:03,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:03,250 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:03,250 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:03,250 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:03,250 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-01-01 21:37:03,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:03,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:03,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:37:03,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:37:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-01 21:37:03,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:37:03,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:03,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:37:03,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:03,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-01 21:37:03,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:37:03,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-01 21:37:03,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:03,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:37:03,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-01 21:37:03,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:03,351 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:37:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-01 21:37:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:37:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-01 21:37:03,353 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:37:03,353 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:37:03,353 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:37:03,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-01 21:37:03,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:37:03,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:03,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:03,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:37:03,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:03,356 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-01-01 21:37:03,357 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-01-01 21:37:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:37:03,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:03,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:03,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:03,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:03,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:37:03,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:37:03,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:37:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:37:03,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:03,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:03,462 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,462 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:03,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:37:03,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,583 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,583 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 [2019-01-01 21:37:03,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,604 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 [2019-01-01 21:37:03,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:03,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,684 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:03,685 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 [2019-01-01 21:37:03,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:03,709 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 [2019-01-01 21:37:03,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:03,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:03,796 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:03,798 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:03,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:03,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:03,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:03,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:03,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:03,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:03,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:03,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:37:03,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:03,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:03,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:03,978 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:03,978 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:03,979 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 [2019-01-01 21:37:03,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:03,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:03,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:03,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:03,989 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 [2019-01-01 21:37:03,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:03,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:03,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:03,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:03,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:03,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:03,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:04,000 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 [2019-01-01 21:37:04,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:04,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:04,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:04,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:04,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:04,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:04,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:04,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:04,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:04,017 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:04,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:04,017 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:04,021 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:04,021 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-01-01 21:37:04,021 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:04,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:04,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:37:04,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:37:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:04,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:04,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:04,179 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:04,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:04,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:37:04,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:37:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:04,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:04,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:04,280 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:04,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:04,430 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:04,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:37:04,438 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-01-01 21:37:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:37:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:37:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:37:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:04,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-01 21:37:04,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:37:04,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-01-01 21:37:04,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:37:04,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:37:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:37:04,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:04,448 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:37:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:37:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-01 21:37:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:37:04,456 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:37:04,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:37:04,462 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-01-01 21:37:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:04,487 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-01 21:37:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:37:04,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-01 21:37:04,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:37:04,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-01-01 21:37:04,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:37:04,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:37:04,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-01 21:37:04,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:04,491 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:37:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-01 21:37:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:37:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:37:04,493 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:37:04,493 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:37:04,493 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:37:04,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:37:04,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:37:04,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:04,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:04,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-01-01 21:37:04,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:37:04,494 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-01-01 21:37:04,494 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-01-01 21:37:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-01-01 21:37:04,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:04,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:04,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:04,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-01 21:37:04,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-01-01 21:37:04,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:04,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:04,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:04,619 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:04,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:04,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:04,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:04,619 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:04,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:04,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:04,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:04,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:37:04,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:04,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:04,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,775 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:04,775 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 [2019-01-01 21:37:04,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:04,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:04,803 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:04,803 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 [2019-01-01 21:37:04,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:04,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:04,828 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:04,828 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 [2019-01-01 21:37:04,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:04,835 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 [2019-01-01 21:37:04,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:04,860 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:04,865 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:04,883 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:04,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:04,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:04,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:04,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:04,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:04,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:04,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:04,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:37:04,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:04,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:04,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:04,969 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:04,969 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:04,970 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 [2019-01-01 21:37:04,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:04,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:04,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:04,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:04,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:04,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:04,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:04,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:04,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:04,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:04,978 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:04,978 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:04,978 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:04,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2019-01-01 21:37:04,979 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:05,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:05,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:37:05,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:37:05,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 [2019-01-01 21:37:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:05,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:05,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,182 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:05,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:05,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:37:05,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:37:05,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:05,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,325 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:05,390 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:05,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:37:05,404 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-01-01 21:37:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:37:05,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:05,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,407 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:05,498 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:05,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:37:05,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-01-01 21:37:05,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:37:05,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:05,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,604 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:05,736 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:05,739 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:37:05,834 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-01-01 21:37:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:37:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-01 21:37:05,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:05,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:37:05,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:37:05,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:05,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-01-01 21:37:05,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:37:05,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-01-01 21:37:05,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:37:05,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-01 21:37:05,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-01-01 21:37:05,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:05,850 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-01-01 21:37:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-01-01 21:37:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-01 21:37:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:37:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-01-01 21:37:05,855 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:37:05,855 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:37:05,855 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:37:05,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-01-01 21:37:05,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:37:05,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:05,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:05,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-01-01 21:37:05,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-01 21:37:05,857 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-01-01 21:37:05,857 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-01-01 21:37:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-01-01 21:37:05,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:05,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:05,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:37:05,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:37:05,902 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 [2019-01-01 21:37:05,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:37:05,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-01 21:37:05,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:37:05,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:37:06,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:37:06,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 21:37:06,026 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:37:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-01-01 21:37:06,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:06,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:06,482 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-01 21:37:06,494 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:06,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:06,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:06,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:06,495 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:06,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:06,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:06,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:06,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:37:06,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:06,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:06,592 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 [2019-01-01 21:37:06,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:06,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:06,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:06,619 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 [2019-01-01 21:37:06,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:06,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:06,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:06,646 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) [2019-01-01 21:37:06,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:06,652 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-01 21:37:06,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:06,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:06,739 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:06,741 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:06,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:06,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:06,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:06,741 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:06,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:06,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:06,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:06,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:37:06,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:06,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:06,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:06,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:06,839 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:06,839 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 [2019-01-01 21:37:06,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:06,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:06,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:06,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:06,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:06,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:06,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:06,849 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 [2019-01-01 21:37:06,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:06,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:06,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:06,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:06,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:06,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:06,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:06,854 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 [2019-01-01 21:37:06,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:06,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:06,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:06,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:06,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:06,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:06,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:06,858 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:06,859 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:06,860 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:06,860 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:06,860 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:06,860 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:06,860 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:37:06,861 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:06,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:06,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:37:06,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:37:06,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-01 21:37:06,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2019-01-01 21:37:06,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:37:07,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:37:07,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:07,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:37:07,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:07,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-01-01 21:37:07,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:07,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-01-01 21:37:07,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:37:07,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-01-01 21:37:07,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:37:07,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:37:07,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-01-01 21:37:07,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:07,004 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-01-01 21:37:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-01-01 21:37:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-01-01 21:37:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:37:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-01-01 21:37:07,009 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-01-01 21:37:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:37:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:37:07,010 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-01-01 21:37:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:07,035 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-01 21:37:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:37:07,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-01-01 21:37:07,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:37:07,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-01-01 21:37:07,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:37:07,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-01 21:37:07,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-01 21:37:07,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:07,040 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-01 21:37:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-01 21:37:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-01-01 21:37:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:37:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-01 21:37:07,043 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:37:07,044 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:37:07,044 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:37:07,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-01 21:37:07,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:37:07,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:07,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:07,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-01-01 21:37:07,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-01 21:37:07,046 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-01-01 21:37:07,046 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-01-01 21:37:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-01-01 21:37:07,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:07,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:07,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:07,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-01-01 21:37:07,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:07,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:07,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:07,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-01-01 21:37:07,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:37:07,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:37:07,138 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 [2019-01-01 21:37:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:07,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:37:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:37:07,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:37:07,375 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-01 21:37:07,396 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:07,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:07,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:07,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:07,397 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:07,397 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:07,397 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:07,397 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:07,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:37:07,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:07,398 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:07,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:07,531 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 [2019-01-01 21:37:07,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:07,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:07,556 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:07,556 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 [2019-01-01 21:37:07,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:07,561 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 [2019-01-01 21:37:07,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:07,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:07,591 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:07,610 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:07,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:07,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:07,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:07,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:07,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:07,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:07,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:07,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:37:07,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:07,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:07,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:07,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:07,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:07,694 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 [2019-01-01 21:37:07,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:07,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:07,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:07,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:07,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:07,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:07,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:07,701 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 [2019-01-01 21:37:07,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:07,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:07,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:07,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:07,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:07,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:07,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:07,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:07,707 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:07,707 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:07,708 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:07,708 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:07,708 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:07,708 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:07,709 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:08,124 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:37:08,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:37:08,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-01 21:37:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-01 21:37:08,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:37:08,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:08,149 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:08,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:37:08,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:37:08,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-01 21:37:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-01 21:37:08,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:37:08,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:08,275 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:08,351 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:37:08,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:37:08,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-01-01 21:37:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 21:37:08,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:37:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-01 21:37:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-01 21:37:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:08,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-01-01 21:37:08,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-01-01 21:37:08,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-01-01 21:37:08,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:37:08,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:37:08,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-01-01 21:37:08,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:08,416 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-01-01 21:37:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-01-01 21:37:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-01 21:37:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:37:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-01-01 21:37:08,421 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-01-01 21:37:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:37:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:37:08,422 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2019-01-01 21:37:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:08,468 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-01-01 21:37:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:37:08,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2019-01-01 21:37:08,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:37:08,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2019-01-01 21:37:08,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:37:08,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:37:08,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-01-01 21:37:08,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:08,473 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-01 21:37:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-01-01 21:37:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-01-01 21:37:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:37:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-01 21:37:08,477 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:37:08,477 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:37:08,477 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:37:08,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-01 21:37:08,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:37:08,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:08,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:08,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:37:08,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-01-01 21:37:08,479 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 [2019-01-01 21:37:08,479 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 [2019-01-01 21:37:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-01-01 21:37:08,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-01-01 21:37:08,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:37:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:37:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:37:08,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:37:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:37:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:37:08,602 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 21:37:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:08,653 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-01 21:37:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:37:08,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-01-01 21:37:08,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:37:08,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-01-01 21:37:08,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:37:08,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:37:08,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-01-01 21:37:08,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:08,658 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-01-01 21:37:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-01-01 21:37:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-01 21:37:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:37:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-01 21:37:08,666 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-01 21:37:08,668 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-01 21:37:08,668 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:37:08,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-01-01 21:37:08,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:37:08,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:08,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:08,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:37:08,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-01-01 21:37:08,671 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 [2019-01-01 21:37:08,671 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 [2019-01-01 21:37:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-01-01 21:37:08,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-01-01 21:37:08,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-01-01 21:37:08,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,941 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-01 21:37:08,961 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:08,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:08,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:08,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:08,962 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:08,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:08,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:08,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:08,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:37:08,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:08,962 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:08,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:09,085 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) [2019-01-01 21:37:09,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:09,094 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 [2019-01-01 21:37:09,127 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:09,127 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 [2019-01-01 21:37:09,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:09,133 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 [2019-01-01 21:37:09,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:09,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:09,200 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:09,202 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:09,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:09,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:09,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:09,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:09,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:09,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:09,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:09,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:37:09,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:09,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:09,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:09,411 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:09,411 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 [2019-01-01 21:37:09,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:09,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:09,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:09,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:09,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:09,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:09,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:09,447 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 [2019-01-01 21:37:09,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:09,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:09,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:09,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:09,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:09,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:09,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:09,458 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:09,462 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:09,462 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:09,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:09,463 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:09,463 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:09,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:09,463 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:09,800 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:37:09,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:37:09,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:37:09,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:09,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:37:09,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:09,846 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:09,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:37:09,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:37:09,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:37:09,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:09,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:37:09,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:09,948 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:10,032 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:37:10,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:37:10,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-01-01 21:37:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:37:10,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:37:10,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:10,049 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:10,134 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:37:10,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:37:10,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-01-01 21:37:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:37:10,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:37:10,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:10,220 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:10,352 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:37:10,352 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:37:10,432 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:10,531 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-01-01 21:37:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-01-01 21:37:10,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:37:10,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:10,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-01-01 21:37:10,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:10,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-01-01 21:37:10,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:10,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-01-01 21:37:10,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-01-01 21:37:10,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-01-01 21:37:10,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:37:10,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:37:10,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-01-01 21:37:10,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:10,565 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-01-01 21:37:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-01-01 21:37:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-01-01 21:37:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 21:37:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-01-01 21:37:10,578 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-01 21:37:10,579 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-01 21:37:10,579 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:37:10,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-01-01 21:37:10,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-01 21:37:10,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:10,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:10,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:37:10,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-01-01 21:37:10,581 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 [2019-01-01 21:37:10,581 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 [2019-01-01 21:37:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-01-01 21:37:10,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:10,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-01-01 21:37:10,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:10,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:10,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-01-01 21:37:10,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:10,784 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-01-01 21:37:10,812 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:10,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:10,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:10,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:10,813 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:10,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:10,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:10,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:10,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-01 21:37:10,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:10,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:10,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,963 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:10,963 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 [2019-01-01 21:37:10,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:10,971 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 [2019-01-01 21:37:10,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:10,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:11,000 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:11,019 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:11,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:11,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:11,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:11,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:11,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:11,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:11,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-01 21:37:11,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:11,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:11,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:11,096 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:11,097 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 [2019-01-01 21:37:11,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:11,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:11,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:11,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:11,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:11,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:11,108 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:11,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:11,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:11,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:11,113 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:11,114 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:11,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:11,114 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:37:11,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:37:11,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-01 21:37:11,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:37:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:37:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,317 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:37:11,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:37:11,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-01 21:37:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:37:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:11,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:37:11,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,563 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,664 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:37:11,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:37:11,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-01-01 21:37:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:37:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:37:11,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:37:11,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,691 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,834 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:37:11,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:37:11,888 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-01-01 21:37:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:37:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:37:11,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:37:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,891 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,988 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:37:11,989 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:37:12,152 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,154 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,158 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,159 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,161 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,161 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,164 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,165 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,312 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,312 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,313 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,313 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,313 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,313 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,317 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,317 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,329 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,329 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,332 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,332 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,864 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,868 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,883 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:37:12,942 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-01-01 21:37:12,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:37:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-01-01 21:37:12,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:37:12,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:12,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-01-01 21:37:12,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-01-01 21:37:12,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:12,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-01-01 21:37:12,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-01 21:37:12,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-01-01 21:37:12,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:37:12,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:37:12,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-01-01 21:37:12,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:12,983 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-01-01 21:37:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-01-01 21:37:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-01-01 21:37:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-01 21:37:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-01-01 21:37:13,007 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-01 21:37:13,007 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-01 21:37:13,007 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:37:13,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-01-01 21:37:13,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-01 21:37:13,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:13,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:13,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:37:13,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-01-01 21:37:13,014 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 [2019-01-01 21:37:13,014 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 [2019-01-01 21:37:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-01-01 21:37:13,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:13,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-01-01 21:37:13,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-01-01 21:37:13,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:13,417 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-01-01 21:37:13,429 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:13,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:13,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:13,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:13,430 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:13,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:13,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:13,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:13,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:37:13,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:13,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:13,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:13,502 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 [2019-01-01 21:37:13,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:13,510 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 [2019-01-01 21:37:13,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:13,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:13,595 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:13,597 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:13,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:13,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:13,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:13,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:13,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:13,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:13,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:13,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:37:13,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:13,598 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:13,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:13,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:13,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:13,683 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 [2019-01-01 21:37:13,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:13,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:13,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:13,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:13,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:13,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:13,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:13,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:13,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:13,690 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:13,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:13,690 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:13,691 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:13,691 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:37:13,691 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:13,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:13,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 21:37:13,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:37:13,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-01 21:37:13,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-01 21:37:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:13,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:37:13,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:13,807 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 21:37:14,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:37:14,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-01 21:37:14,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-01 21:37:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:37:14,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:14,453 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 21:37:14,566 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:37:14,566 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-01 21:37:14,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2019-01-01 21:37:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:37:14,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:37:14,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:14,653 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:14,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 21:37:14,835 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:37:14,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-01 21:37:14,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2019-01-01 21:37:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-01-01 21:37:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:37:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-01-01 21:37:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-01-01 21:37:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:14,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-01-01 21:37:14,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:14,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-01-01 21:37:14,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:14,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:14,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:14,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:14,999 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:14,999 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:14,999 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:14,999 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:37:14,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:15,000 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:15,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:15,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:15 BoogieIcfgContainer [2019-01-01 21:37:15,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:15,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:15,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:15,010 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:15,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:58" (3/4) ... [2019-01-01 21:37:15,016 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:15,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:15,017 INFO L168 Benchmark]: Toolchain (without parser) took 17029.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 951.4 MB in the beginning and 864.8 MB in the end (delta: 86.5 MB). Peak memory consumption was 396.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:15,018 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:15,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:15,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.28 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:15,020 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:15,020 INFO L168 Benchmark]: RCFGBuilder took 341.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:15,021 INFO L168 Benchmark]: BuchiAutomizer took 16336.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 864.8 MB in the end (delta: 243.9 MB). Peak memory consumption was 428.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:15,022 INFO L168 Benchmark]: Witness Printer took 6.59 ms. Allocated memory is still 1.3 GB. Free memory is still 864.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:15,026 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 40.28 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 341.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16336.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 864.8 MB in the end (delta: 243.9 MB). Peak memory consumption was 428.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.59 ms. Allocated memory is still 1.3 GB. Free memory is still 864.8 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 16.2s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 8.7s. Construction of modules took 1.1s. Büchi inclusion checks took 6.0s. 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, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...