./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 0ed9222f 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-0ed9222-m [2019-01-14 02:19:31,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:31,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:31,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:31,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:31,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:31,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:31,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:31,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:31,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:31,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:31,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:31,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:31,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:31,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:31,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:31,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:31,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:32,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:32,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:32,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:32,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:32,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:32,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:32,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:32,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:32,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:32,009 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:32,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:32,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:32,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:32,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:32,013 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:32,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:32,014 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:32,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:32,015 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:32,037 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:32,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:32,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:32,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:32,039 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:32,039 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:32,040 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:32,040 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:32,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:32,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:32,042 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:32,044 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:32,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:32,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:32,045 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:32,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:32,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:32,045 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:32,047 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:32,048 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-14 02:19:32,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:32,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:32,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:32,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:32,102 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:32,103 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-14 02:19:32,169 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd4a9390/ca9448c2e27b429a9dc636111e6cfee2/FLAG4bc8157b0 [2019-01-14 02:19:32,589 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:32,590 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2019-01-14 02:19:32,596 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd4a9390/ca9448c2e27b429a9dc636111e6cfee2/FLAG4bc8157b0 [2019-01-14 02:19:32,978 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd4a9390/ca9448c2e27b429a9dc636111e6cfee2 [2019-01-14 02:19:32,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:32,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:32,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:32,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:32,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:32,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:32" (1/1) ... [2019-01-14 02:19:32,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4bc483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:32, skipping insertion in model container [2019-01-14 02:19:32,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:32" (1/1) ... [2019-01-14 02:19:33,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:33,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:33,228 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:33,236 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:33,253 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:33,269 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:33,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33 WrapperNode [2019-01-14 02:19:33,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:33,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:33,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:33,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:33,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:33,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:33,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:33,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:33,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (1/1) ... [2019-01-14 02:19:33,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:33,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:33,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:33,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:33,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (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-14 02:19:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:33,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:33,620 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:33,620 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:19:33,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:33 BoogieIcfgContainer [2019-01-14 02:19:33,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:33,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:33,623 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:33,627 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:33,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:33,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:32" (1/3) ... [2019-01-14 02:19:33,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71724996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:33, skipping insertion in model container [2019-01-14 02:19:33,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:33,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:33" (2/3) ... [2019-01-14 02:19:33,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71724996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:33, skipping insertion in model container [2019-01-14 02:19:33,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:33,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:33" (3/3) ... [2019-01-14 02:19:33,632 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2019-01-14 02:19:33,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:33,691 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:33,691 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:33,692 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:33,692 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:33,692 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:33,692 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:33,693 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:33,693 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:33,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:19:33,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:33,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:33,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:33,741 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:33,741 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:33,741 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:33,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:19:33,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:33,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:33,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:33,743 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:33,743 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:33,750 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-14 02:19:33,750 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-14 02:19:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:33,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:33,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:33,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:19:33,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:33,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:19:33,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:33,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:33,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:34,008 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:19:34,097 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:34,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:34,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:34,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:34,099 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:34,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:34,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:34,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:34,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:34,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:34,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:34,120 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-14 02:19:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:34,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:34,177 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-14 02:19:34,384 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:34,385 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-14 02:19:34,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:34,399 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-14 02:19:34,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:34,453 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-14 02:19:34,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:34,469 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:34,526 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:34,527 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) [2019-01-14 02:19:34,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:34,540 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:34,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:34,588 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:34,638 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:34,641 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:34,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:34,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:34,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:34,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:34,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:34,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:34,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:34,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:34,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:34,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:34,649 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-14 02:19:34,678 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-14 02:19:34,685 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-14 02:19:34,704 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-14 02:19:35,135 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:35,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:35,142 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-14 02:19:35,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:35,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:35,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:35,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:35,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:35,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:35,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:35,159 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-14 02:19:35,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:35,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:35,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:35,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:35,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:35,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:35,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:35,187 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-14 02:19:35,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:35,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:35,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:35,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:35,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:35,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:35,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:35,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:35,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:35,206 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:35,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:35,209 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:35,209 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:35,210 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-14 02:19:35,212 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:35,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:35,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:35,368 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-14 02:19:35,388 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-14 02:19:35,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:19:35,516 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-14 02:19:35,516 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-14 02:19:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:19:35,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:19:35,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:35,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:35,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:35,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:19:35,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:35,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:19:35,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:35,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:19:35,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:19:35,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:19:35,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:19:35,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:35,539 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:19:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:19:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:19:35,565 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:35,565 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:35,565 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:35,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:19:35,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:35,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:35,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:35,567 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:19:35,567 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:35,567 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-14 02:19:35,567 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-14 02:19:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:19:35,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:19:35,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:35,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-14 02:19:35,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:35,658 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:35,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:35,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:35,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:35,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:35,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:35,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:35,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:35,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:35,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:35,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:35,663 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-14 02:19:35,699 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-14 02:19:35,723 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-14 02:19:35,727 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-14 02:19:35,846 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:35,846 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-14 02:19:35,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:35,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:35,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:35,873 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-14 02:19:35,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:35,878 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-14 02:19:35,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:35,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:35,937 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:35,940 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:35,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:35,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:35,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:35,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:35,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:35,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:35,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:35,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:35,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:35,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:35,944 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-14 02:19:35,950 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-14 02:19:35,965 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-14 02:19:35,973 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-14 02:19:36,121 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:19:36,231 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:19:36,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:36,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:36,442 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-14 02:19:36,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:36,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:36,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:36,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:36,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:36,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:36,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:36,457 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-14 02:19:36,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:36,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:36,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:36,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:36,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:36,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:36,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:36,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:36,474 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:36,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:36,477 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:36,477 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:36,478 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:36,478 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-14 02:19:36,478 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:36,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:36,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:36,583 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-14 02:19:36,584 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-14 02:19:36,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:36,601 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-14 02:19:36,602 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-14 02:19:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:19:36,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:36,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:36,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:36,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:36,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:19:36,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:36,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:19:36,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:36,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:19:36,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:19:36,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:36,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:19:36,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:36,609 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:19:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:19:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:19:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:19:36,611 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:36,611 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:36,611 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:36,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-14 02:19:36,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:36,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:36,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:36,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:19:36,613 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:36,613 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-14 02:19:36,613 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-14 02:19:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-14 02:19:36,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:36,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-14 02:19:36,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-14 02:19:36,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:36,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:36,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:36,712 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:36,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:36,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:36,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:36,713 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:36,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:36,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:36,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:36,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:36,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:36,714 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:36,716 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-14 02:19:36,782 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-14 02:19:36,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:36,811 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-14 02:19:36,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:36,877 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-14 02:19:36,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:36,881 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-14 02:19:36,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:36,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:36,932 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:36,934 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:36,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:36,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:36,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:36,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:36,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:36,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:36,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:36,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:36,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:36,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:36,937 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-14 02:19:36,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:36,967 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-14 02:19:36,974 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-14 02:19:37,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:37,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:37,068 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-14 02:19:37,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:37,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:37,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:37,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:37,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:37,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:37,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:37,081 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:37,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:37,086 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:37,086 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:37,086 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:37,086 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:37,087 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-14 02:19:37,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,121 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-14 02:19:37,122 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-14 02:19:37,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:19:37,139 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-14 02:19:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:19:37,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:37,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:37,142 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,211 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-14 02:19:37,211 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-14 02:19:37,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:19:37,221 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-14 02:19:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:19:37,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:37,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:37,224 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,289 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-14 02:19:37,290 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-14 02:19:37,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:19:37,303 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-14 02:19:37,304 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-14 02:19:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:19:37,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:37,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:37,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:19:37,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:37,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:19:37,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:37,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-14 02:19:37,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:37,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-14 02:19:37,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:19:37,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:37,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-14 02:19:37,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:37,311 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:19:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-14 02:19:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-14 02:19:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-14 02:19:37,313 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:19:37,313 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:19:37,313 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:37,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-14 02:19:37,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:37,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:37,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:37,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:37,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:37,314 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-14 02:19:37,315 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-14 02:19:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:19:37,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-14 02:19:37,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-14 02:19:37,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:37,420 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:37,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:37,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:37,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:37,421 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:37,421 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:37,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:37,421 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:37,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:37,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:37,422 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:37,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-14 02:19:37,427 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-14 02:19:37,439 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-14 02:19:37,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-14 02:19:37,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:37,587 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-14 02:19:37,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:37,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:37,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:37,619 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-14 02:19:37,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:37,630 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-14 02:19:37,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:37,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:37,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:37,668 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-14 02:19:37,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:37,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:37,714 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:37,715 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-14 02:19:37,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:37,719 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-14 02:19:37,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:37,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:37,778 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:37,779 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:37,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:37,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:37,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:37,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:37,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:37,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:37,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:37,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:37,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:37,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:37,782 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-14 02:19:37,796 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-14 02:19:37,800 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-14 02:19:37,808 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-14 02:19:37,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:37,880 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:37,882 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-14 02:19:37,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:37,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:37,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:37,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:37,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:37,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:37,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:37,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:37,890 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-14 02:19:37,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:37,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:37,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:37,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:37,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:37,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:37,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:37,905 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-14 02:19:37,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:37,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:37,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:37,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:37,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:37,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:37,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:37,914 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-14 02:19:37,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:37,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:37,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:37,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:37,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:37,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:37,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:37,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:37,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:37,926 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:37,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:37,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:37,926 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:37,927 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-14 02:19:37,928 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:37,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:37,987 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-14 02:19:37,987 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-14 02:19:37,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:19:37,998 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-14 02:19:38,000 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-14 02:19:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-14 02:19:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:19:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:19:38,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:38,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-14 02:19:38,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:38,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-14 02:19:38,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:19:38,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:19:38,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:19:38,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:38,004 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:19:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:19:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 02:19:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-14 02:19:38,008 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:19:38,008 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:19:38,008 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:38,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-14 02:19:38,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:38,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:38,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:38,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:19:38,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:38,012 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-14 02:19:38,012 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-14 02:19:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:19:38,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:38,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:38,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:38,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:38,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,071 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-14 02:19:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:19:38,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:19:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:19:38,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:38,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:38,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:38,110 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:38,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:38,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:38,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:38,111 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:38,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:38,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:38,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:38,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:38,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:38,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:38,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-14 02:19:38,161 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-14 02:19:38,167 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-14 02:19:38,209 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-14 02:19:38,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:38,267 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-14 02:19:38,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:38,275 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-14 02:19:38,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:38,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:38,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:38,339 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-14 02:19:38,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:38,361 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-14 02:19:38,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:38,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:38,416 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:38,418 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:38,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:38,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:38,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:38,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:38,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:38,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:38,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:38,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:38,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:38,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:38,421 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-14 02:19:38,428 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-14 02:19:38,444 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-14 02:19:38,482 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-14 02:19:38,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:38,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:38,568 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-14 02:19:38,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:38,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:38,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:38,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:38,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:38,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:38,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:38,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:38,574 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-14 02:19:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:38,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:38,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:38,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:38,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:38,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:38,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:38,582 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-14 02:19:38,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:38,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:38,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:38,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:38,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:38,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:38,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:38,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:38,593 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:38,593 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:38,593 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:38,593 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:38,594 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:38,594 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-14 02:19:38,594 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:38,681 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-14 02:19:38,682 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-14 02:19:38,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:19:38,694 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-14 02:19:38,695 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-14 02:19:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:38,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:38,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:38,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:38,837 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-14 02:19:38,837 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-14 02:19:38,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:19:38,889 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-14 02:19:38,889 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-14 02:19:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:38,890 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:38,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,008 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-14 02:19:39,009 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-14 02:19:39,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:19:39,024 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-14 02:19:39,027 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-14 02:19:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:19:39,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:39,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-14 02:19:39,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:19:39,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-01-14 02:19:39,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:39,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:39,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:19:39,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:39,033 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:19:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:19:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-14 02:19:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:19:39,035 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:19:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:19:39,039 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-01-14 02:19:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:39,059 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-14 02:19:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:19:39,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-14 02:19:39,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:19:39,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-01-14 02:19:39,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:39,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:39,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-14 02:19:39,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:39,063 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:19:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-14 02:19:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-14 02:19:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:19:39,065 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:39,065 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:39,065 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:19:39,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:19:39,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:19:39,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:39,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:39,066 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-01-14 02:19:39,066 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:19:39,066 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-14 02:19:39,067 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-14 02:19:39,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-01-14 02:19:39,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:39,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-14 02:19:39,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:39,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:39,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:39,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-01-14 02:19:39,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:39,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:39,233 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-14 02:19:39,251 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:39,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:39,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:39,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:39,252 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:39,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:39,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:39,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:39,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:19:39,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:39,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:39,254 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-14 02:19:39,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-14 02:19:39,266 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-14 02:19:39,283 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-14 02:19:39,349 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:39,349 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-14 02:19:39,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:39,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:39,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:39,381 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-14 02:19:39,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:39,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:39,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:39,406 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-14 02:19:39,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:39,412 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-14 02:19:39,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:39,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:39,442 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:39,461 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:39,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:39,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:39,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:39,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:39,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:39,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:39,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:39,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:19:39,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:39,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:39,463 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-14 02:19:39,472 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-14 02:19:39,475 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-14 02:19:39,480 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-14 02:19:39,539 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:39,539 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:39,540 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-14 02:19:39,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:39,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:39,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:39,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:39,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:39,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:39,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:39,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:39,547 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:39,547 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:39,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:39,547 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:39,548 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:39,548 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-14 02:19:39,548 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,711 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-14 02:19:39,712 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-14 02:19:39,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:39,727 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-14 02:19:39,729 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-14 02:19:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:39,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:39,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:39,730 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,844 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-14 02:19:39,845 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-14 02:19:39,845 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:39,891 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-14 02:19:39,892 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-14 02:19:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:39,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:39,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:39,893 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:39,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,010 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-14 02:19:40,011 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-14 02:19:40,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:40,023 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-14 02:19:40,024 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-14 02:19:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:40,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:40,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:40,025 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:40,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:40,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,107 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-14 02:19:40,107 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-14 02:19:40,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:40,145 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-14 02:19:40,148 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-14 02:19:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:19:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:40,149 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:40,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:40,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,269 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-14 02:19:40,270 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-14 02:19:40,272 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:40,357 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-14 02:19:40,361 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-14 02:19:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-14 02:19:40,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:40,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:40,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:19:40,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:19:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:40,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-01-14 02:19:40,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:19:40,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-01-14 02:19:40,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:19:40,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-14 02:19:40,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-01-14 02:19:40,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:40,386 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-01-14 02:19:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-01-14 02:19:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-14 02:19:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:19:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-01-14 02:19:40,393 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-14 02:19:40,393 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-14 02:19:40,393 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:19:40,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-01-14 02:19:40,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:40,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:40,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:40,401 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-01-14 02:19:40,402 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-14 02:19:40,402 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-14 02:19:40,402 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-14 02:19:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-01-14 02:19:40,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:40,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:40,482 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-14 02:19:40,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:40,482 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-14 02:19:40,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:19:40,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 02:19:40,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:19:40,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:40,529 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-14 02:19:40,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:40,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 02:19:40,553 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:19:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-01-14 02:19:40,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:40,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:40,646 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:40,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:40,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:40,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:40,647 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:40,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:40,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:40,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:40,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:19:40,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:40,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:40,649 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-14 02:19:40,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:40,660 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-14 02:19:40,669 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-14 02:19:40,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:40,740 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-14 02:19:40,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:40,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:40,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:40,765 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-14 02:19:40,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:40,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:40,796 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:40,796 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:40,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:40,802 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:40,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:40,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:40,885 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:40,886 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:40,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:40,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:40,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:40,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:40,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:40,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:40,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:40,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-14 02:19:40,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:40,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:40,889 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-14 02:19:40,892 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-14 02:19:40,895 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-14 02:19:40,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-14 02:19:40,963 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:40,963 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:40,965 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-14 02:19:40,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:40,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:40,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:40,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:40,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:40,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:40,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:40,975 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-14 02:19:40,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:40,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:40,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:40,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:40,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:40,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:40,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:40,983 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-14 02:19:40,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:40,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:40,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:40,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:40,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:40,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:40,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:40,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:40,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:40,994 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:40,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:40,995 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:40,996 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:40,996 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-14 02:19:40,997 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:41,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:41,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:41,068 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-14 02:19:41,068 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-14 02:19:41,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 02:19:41,112 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-14 02:19:41,114 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-14 02:19:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:19:41,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:19:41,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:41,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:19:41,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:41,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-01-14 02:19:41,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:41,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-01-14 02:19:41,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:41,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-01-14 02:19:41,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:41,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:41,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-01-14 02:19:41,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:41,119 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-01-14 02:19:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-01-14 02:19:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-01-14 02:19:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:19:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-01-14 02:19:41,123 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-01-14 02:19:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:19:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:19:41,124 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-01-14 02:19:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:41,158 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-14 02:19:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:19:41,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-01-14 02:19:41,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:41,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-01-14 02:19:41,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:19:41,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-14 02:19:41,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-14 02:19:41,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:41,163 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-14 02:19:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-14 02:19:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-01-14 02:19:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:19:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-14 02:19:41,167 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:19:41,167 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:19:41,168 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:19:41,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-14 02:19:41,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:41,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:41,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:41,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-01-14 02:19:41,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-14 02:19:41,169 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-14 02:19:41,169 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-14 02:19:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-01-14 02:19:41,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:41,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:41,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:41,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-01-14 02:19:41,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:41,222 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-01-14 02:19:41,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:41,412 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-14 02:19:41,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:41,413 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-14 02:19:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:41,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:41,441 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-14 02:19:41,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:41,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:19:41,517 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:41,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:41,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:41,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:41,518 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:41,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:41,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:41,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:41,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:19:41,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:41,519 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:41,520 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-14 02:19:41,524 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-14 02:19:41,532 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-14 02:19:41,548 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-14 02:19:41,642 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:41,642 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-14 02:19:41,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:41,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:41,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:41,671 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-14 02:19:41,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:41,676 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-14 02:19:41,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:41,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:41,704 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:41,723 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:41,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:41,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:41,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:41,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:41,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:41,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:41,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:41,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-14 02:19:41,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:41,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:41,725 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-14 02:19:41,731 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-14 02:19:41,739 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-14 02:19:41,748 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-14 02:19:41,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:41,809 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:41,810 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-14 02:19:41,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:41,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:41,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:41,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:41,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:41,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:41,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:41,824 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-14 02:19:41,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:41,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:41,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:41,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:41,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:41,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:41,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:41,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:41,839 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:41,840 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:41,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:41,841 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:41,841 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:41,841 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-14 02:19:41,841 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,102 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-14 02:19:42,102 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-14 02:19:42,102 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:19:42,151 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-14 02:19:42,156 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-14 02:19:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-14 02:19:42,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:19:42,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:42,157 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,254 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-14 02:19:42,254 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-14 02:19:42,255 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:19:42,275 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-14 02:19:42,275 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-14 02:19:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-14 02:19:42,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:19:42,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:42,276 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:42,346 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-14 02:19:42,347 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-14 02:19:42,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:19:42,399 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-14 02:19:42,400 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-14 02:19:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-14 02:19:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:19:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:42,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-14 02:19:42,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:42,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-14 02:19:42,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:42,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-01-14 02:19:42,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-01-14 02:19:42,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-01-14 02:19:42,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:42,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:42,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-01-14 02:19:42,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:42,410 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-01-14 02:19:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-01-14 02:19:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-14 02:19:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:19:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-01-14 02:19:42,416 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-01-14 02:19:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:19:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:19:42,417 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2019-01-14 02:19:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:42,451 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-01-14 02:19:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:19:42,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2019-01-14 02:19:42,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-14 02:19:42,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2019-01-14 02:19:42,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:19:42,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:19:42,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-01-14 02:19:42,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:42,456 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-14 02:19:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-01-14 02:19:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-01-14 02:19:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:19:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-14 02:19:42,460 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:19:42,460 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:19:42,460 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:19:42,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-14 02:19:42,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:19:42,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:42,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:42,461 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:19:42,461 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-01-14 02:19:42,461 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-14 02:19:42,462 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-14 02:19:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-01-14 02:19:42,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:42,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-01-14 02:19:42,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:42,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:42,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-14 02:19:42,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:42,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:19:42,600 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:19:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:19:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:19:42,603 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 02:19:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:42,699 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-14 02:19:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:19:42,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-01-14 02:19:42,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:19:42,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-01-14 02:19:42,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:19:42,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:19:42,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-01-14 02:19:42,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:42,705 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-01-14 02:19:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-01-14 02:19:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-14 02:19:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:19:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-14 02:19:42,712 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 02:19:42,712 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 02:19:42,712 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:19:42,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-01-14 02:19:42,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:19:42,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:42,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:42,718 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:19:42,718 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-01-14 02:19:42,719 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-14 02:19:42,719 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-14 02:19:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-01-14 02:19:42,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-01-14 02:19:42,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:42,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-01-14 02:19:42,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:42,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:42,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:42,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:42,990 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-14 02:19:43,001 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:43,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:43,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:43,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:43,002 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:43,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:43,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:43,002 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:43,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-14 02:19:43,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:43,003 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:43,005 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-14 02:19:43,010 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-14 02:19:43,019 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-14 02:19:43,027 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-14 02:19:43,085 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:43,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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:43,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:43,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:43,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:43,114 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) [2019-01-14 02:19:43,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:43,128 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:43,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:43,177 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:43,204 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:43,205 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:43,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:43,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:43,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:43,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:43,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:43,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:43,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:43,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-14 02:19:43,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:43,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:43,208 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-14 02:19:43,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-14 02:19:43,223 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-14 02:19:43,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-14 02:19:43,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:43,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:43,396 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-14 02:19:43,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:43,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:43,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:43,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:43,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:43,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:43,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:43,405 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-14 02:19:43,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:43,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:43,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:43,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:43,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:43,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:43,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:43,411 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:43,414 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:43,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:43,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:43,415 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:43,415 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:43,415 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-14 02:19:43,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,529 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-14 02:19:43,529 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-14 02:19:43,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:19:43,536 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-14 02:19:43,537 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-14 02:19:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:43,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:19:43,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:43,538 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,815 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-14 02:19:43,816 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-14 02:19:43,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:19:43,821 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-14 02:19:43,822 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-14 02:19:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:19:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:43,823 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,895 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-14 02:19:43,896 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-14 02:19:43,896 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:19:43,911 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-14 02:19:43,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:19:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:19:43,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:43,914 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:43,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:44,007 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-14 02:19:44,008 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-14 02:19:44,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:19:44,090 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-14 02:19:44,091 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-14 02:19:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:19:44,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:19:44,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:44,092 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:44,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:44,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:44,215 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-14 02:19:44,215 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-14 02:19:44,215 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:19:44,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,344 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,346 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,346 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,346 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,346 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:44,361 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-14 02:19:44,365 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-14 02:19:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-01-14 02:19:44,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:19:44,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:44,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-01-14 02:19:44,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:44,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-01-14 02:19:44,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:44,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-01-14 02:19:44,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-01-14 02:19:44,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-01-14 02:19:44,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:19:44,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:44,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-01-14 02:19:44,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:44,396 INFO L706 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-01-14 02:19:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-01-14 02:19:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-01-14 02:19:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 02:19:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-01-14 02:19:44,411 INFO L729 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-14 02:19:44,411 INFO L609 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-14 02:19:44,411 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:19:44,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-01-14 02:19:44,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:19:44,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:44,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:44,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:19:44,413 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-01-14 02:19:44,413 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-14 02:19:44,413 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-14 02:19:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-01-14 02:19:44,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:44,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-01-14 02:19:44,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-01-14 02:19:44,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:44,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:44,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:44,646 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-01-14 02:19:44,673 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:44,674 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:44,674 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:44,674 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:44,674 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:44,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:44,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:44,675 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:44,675 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-14 02:19:44,675 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:44,675 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:44,676 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-14 02:19:44,688 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-14 02:19:44,695 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-14 02:19:44,699 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-14 02:19:44,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:44,765 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-14 02:19:44,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:44,770 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-14 02:19:44,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:44,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:44,799 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:44,817 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:44,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:44,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:44,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:44,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:44,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:44,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:44,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:44,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-14 02:19:44,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:44,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:44,819 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-14 02:19:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:44,834 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-14 02:19:44,837 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-14 02:19:44,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:44,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:44,884 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-14 02:19:44,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:44,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:44,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:44,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:44,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:44,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:44,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:44,894 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:44,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:44,900 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:44,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:44,902 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:44,902 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:44,902 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-14 02:19:44,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:44,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:44,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,146 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-14 02:19:45,147 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-14 02:19:45,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:19:45,155 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-14 02:19:45,156 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-14 02:19:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:19:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:45,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:19:45,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:45,157 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,368 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-14 02:19:45,368 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-14 02:19:45,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:19:45,404 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-14 02:19:45,404 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-14 02:19:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:19:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:45,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:19:45,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:45,405 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,523 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-14 02:19:45,524 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-14 02:19:45,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:19:45,536 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-14 02:19:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:19:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:19:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:19:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:45,542 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,677 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-14 02:19:45,677 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-14 02:19:45,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:19:45,744 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-14 02:19:45,745 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-14 02:19:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:19:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:19:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:19:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:45,746 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:45,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:45,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:45,865 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-14 02:19:45,865 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-14 02:19:45,865 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:19:46,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,014 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,111 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,111 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,111 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,111 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,111 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,112 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,112 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,112 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,112 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,112 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,113 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,113 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,115 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,115 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,115 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,116 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,117 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,335 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,338 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,338 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,338 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,339 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,340 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,344 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,345 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,350 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,356 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:19:46,421 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-14 02:19:46,422 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-14 02:19:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:19:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-01-14 02:19:46,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:19:46,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-01-14 02:19:46,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-01-14 02:19:46,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-01-14 02:19:46,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-14 02:19:46,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-01-14 02:19:46,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:19:46,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:19:46,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-01-14 02:19:46,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:46,465 INFO L706 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-01-14 02:19:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-01-14 02:19:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-01-14 02:19:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-14 02:19:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-01-14 02:19:46,491 INFO L729 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-14 02:19:46,491 INFO L609 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-14 02:19:46,491 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:19:46,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-01-14 02:19:46,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-14 02:19:46,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:46,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:46,497 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:19:46,497 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-01-14 02:19:46,498 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-14 02:19:46,498 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-14 02:19:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-01-14 02:19:46,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-01-14 02:19:46,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-01-14 02:19:46,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,948 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-01-14 02:19:46,959 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:46,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:46,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:46,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:46,960 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:46,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:46,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:46,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:46,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-14 02:19:46,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:46,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:46,962 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-14 02:19:46,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-14 02:19:46,973 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-14 02:19:46,975 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-14 02:19:47,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:47,025 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-14 02:19:47,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:47,032 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-14 02:19:47,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:47,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:47,109 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:47,110 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:47,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:47,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:47,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:47,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:47,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:47,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:47,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:47,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-14 02:19:47,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:47,111 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:47,112 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-14 02:19:47,121 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-14 02:19:47,127 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-14 02:19:47,129 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-14 02:19:47,180 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:47,180 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:47,182 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-14 02:19:47,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:47,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:47,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:47,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:47,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:47,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:47,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:47,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:47,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:47,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:47,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:47,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:47,188 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:47,188 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-14 02:19:47,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,270 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-14 02:19:47,271 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-14 02:19:47,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-14 02:19:47,289 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-14 02:19:47,292 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-14 02:19:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:47,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:19:47,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,293 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,413 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-14 02:19:47,414 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-14 02:19:47,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-14 02:19:47,442 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-14 02:19:47,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-14 02:19:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:19:47,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:19:47,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,444 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,535 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-14 02:19:47,536 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-14 02:19:47,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-14 02:19:47,588 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-14 02:19:47,590 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-14 02:19:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:19:47,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:19:47,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,591 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,721 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-14 02:19:47,722 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-14 02:19:47,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-01-14 02:19:48,481 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-14 02:19:48,482 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-14 02:19:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-01-14 02:19:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:19:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-01-14 02:19:48,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:48,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-01-14 02:19:48,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:48,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-01-14 02:19:48,490 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:48,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-01-14 02:19:48,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:48,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:48,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:48,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:48,491 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:48,491 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:48,491 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:48,491 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:19:48,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:48,491 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:48,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:48,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:48 BoogieIcfgContainer [2019-01-14 02:19:48,501 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:48,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:48,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:48,502 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:48,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:33" (3/4) ... [2019-01-14 02:19:48,509 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:48,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:48,510 INFO L168 Benchmark]: Toolchain (without parser) took 15526.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 951.4 MB in the beginning and 868.6 MB in the end (delta: 82.7 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:48,511 INFO L168 Benchmark]: CDTParser took 0.19 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-14 02:19:48,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.30 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-14 02:19:48,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.72 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-14 02:19:48,512 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 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-14 02:19:48,513 INFO L168 Benchmark]: RCFGBuilder took 284.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:48,513 INFO L168 Benchmark]: BuchiAutomizer took 14878.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 868.6 MB in the end (delta: 261.2 MB). Peak memory consumption was 416.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:48,516 INFO L168 Benchmark]: Witness Printer took 6.90 ms. Allocated memory is still 1.3 GB. Free memory is still 868.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:48,525 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.30 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 41.72 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 25.00 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 284.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14878.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 868.6 MB in the end (delta: 261.2 MB). Peak memory consumption was 416.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.90 ms. Allocated memory is still 1.3 GB. Free memory is still 868.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 7.9s. Construction of modules took 1.2s. Büchi inclusion checks took 5.2s. 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.1s 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.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms 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...