./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_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 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:33:50,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:50,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:50,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:50,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:50,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:50,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:50,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:50,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:50,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:50,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:50,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:50,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:50,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:50,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:50,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:50,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:50,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:50,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:50,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:50,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:50,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:50,120 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:50,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:50,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:50,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:50,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:50,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:50,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:50,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:50,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:50,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:50,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:50,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:50,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:50,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:50,135 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:50,172 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:50,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:50,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:50,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:50,175 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:50,175 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:50,175 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:50,177 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:50,177 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:50,177 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:50,178 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:50,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:50,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:50,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:50,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:50,179 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:50,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:50,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:50,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:50,180 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:50,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:50,182 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:50,182 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:50,183 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:50,184 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 -> 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da [2019-01-01 21:33:50,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:50,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:50,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:50,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:50,277 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:50,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:50,354 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae008dfdd/ab604abef4ac4ecc911363ace84a593b/FLAGd24e3f819 [2019-01-01 21:33:50,929 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:50,930 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:50,937 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae008dfdd/ab604abef4ac4ecc911363ace84a593b/FLAGd24e3f819 [2019-01-01 21:33:51,294 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae008dfdd/ab604abef4ac4ecc911363ace84a593b [2019-01-01 21:33:51,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:51,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:51,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:51,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:51,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:51,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54008995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51, skipping insertion in model container [2019-01-01 21:33:51,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:51,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:51,576 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:51,581 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:51,606 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:51,626 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:51,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51 WrapperNode [2019-01-01 21:33:51,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:51,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:51,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:51,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:51,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:51,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:51,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:51,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:51,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:51,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:51,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:51,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:51,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:52,052 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:52,052 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52 BoogieIcfgContainer [2019-01-01 21:33:52,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:52,054 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:52,054 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:52,059 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:52,060 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:51" (1/3) ... [2019-01-01 21:33:52,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a2aad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:52, skipping insertion in model container [2019-01-01 21:33:52,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (2/3) ... [2019-01-01 21:33:52,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a2aad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:52, skipping insertion in model container [2019-01-01 21:33:52,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52" (3/3) ... [2019-01-01 21:33:52,065 INFO L375 chiAutomizerObserver]: Analyzing ICFG BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:52,134 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:52,135 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:52,135 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:52,135 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:52,136 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:52,136 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:52,136 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:52,136 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:52,136 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:52,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:52,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:52,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:52,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:52,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:52,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:52,185 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:52,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:52,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:52,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:52,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:52,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:52,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:52,198 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 7#L18true assume main_~y1~0 > 0 && main_~y2~0 > 0; 8#L20-2true [2019-01-01 21:33:52,199 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(main_~y1~0 != main_~y2~0); 10#L20true assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 8#L20-2true [2019-01-01 21:33:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-01 21:33:52,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2019-01-01 21:33:52,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:52,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:52,341 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-01 21:33:52,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:52,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:52,477 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 21:33:52,658 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:52,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:52,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:52,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:52,661 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:52,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:52,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:52,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:33:52,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:52,663 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:52,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:53,247 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:53,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:53,262 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,288 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 21:33:53,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:53,327 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 [2019-01-01 21:33:53,480 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:53,482 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:53,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:53,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:53,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:53,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:53,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:53,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:53,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:33:53,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:53,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:53,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:53,731 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:53,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:53,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:53,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:53,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:53,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:53,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:53,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:53,810 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:53,842 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:33:53,842 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:53,845 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:53,849 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:53,850 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:53,851 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = -1*ULTIMATE.start_main_~y2~0 + 1*ULTIMATE.start_main_~y1~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2019-01-01 21:33:53,875 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:54,240 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:54,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:33:54,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:33:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:33:54,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:33:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:33:54,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:54,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:33:54,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:54,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:33:54,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:33:54,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:54,655 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:33:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:33:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:33:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:33:54,683 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:54,683 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:54,683 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:54,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-01 21:33:54,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:54,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:54,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:54,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:33:54,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:54,685 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 82#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 88#L20-2 assume !!(main_~y1~0 != main_~y2~0); 87#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 83#L20-2 [2019-01-01 21:33:54,685 INFO L796 eck$LassoCheckResult]: Loop: 83#L20-2 assume !!(main_~y1~0 != main_~y2~0); 84#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 83#L20-2 [2019-01-01 21:33:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2019-01-01 21:33:54,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2019-01-01 21:33:54,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2019-01-01 21:33:54,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,830 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:54,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:54,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:54,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:54,831 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:54,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:54,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:54,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:54,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-01 21:33:54,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:54,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:54,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:54,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:54,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,429 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-01 21:33:55,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,490 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,526 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:55,526 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:55,543 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,566 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:55,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,776 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:55,778 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:55,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:55,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:55,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:55,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:55,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:55,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:55,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-01 21:33:55,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:55,780 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:55,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-01 21:33:55,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,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-01 21:33:55,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,995 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,995 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:55,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:55,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:55,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:55,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:55,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:56,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:56,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:56,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:56,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:56,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:56,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:56,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:56,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:56,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:56,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:56,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:56,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:56,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:56,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:56,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:56,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:56,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:56,062 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:56,065 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:56,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:56,070 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:56,071 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:56,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = 1*ULTIMATE.start_main_~y1~0 - 1*ULTIMATE.start_main_~y2~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2019-01-01 21:33:56,084 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:56,239 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:33:56,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:33:56,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 17 transitions. Complement of second has 6 states. [2019-01-01 21:33:56,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:33:56,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:56,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:56,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:33:56,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2019-01-01 21:33:56,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:56,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:56,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:56,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:56,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-01 21:33:56,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:56,347 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-01 21:33:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:33:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:56,350 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:56,350 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:56,350 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:56,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-01 21:33:56,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:56,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:56,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:56,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-01 21:33:56,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:56,352 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 152#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 153#L20-2 assume !!(main_~y1~0 != main_~y2~0); 158#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 159#L20-2 assume !!(main_~y1~0 != main_~y2~0); 160#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 154#L20-2 [2019-01-01 21:33:56,353 INFO L796 eck$LassoCheckResult]: Loop: 154#L20-2 assume !!(main_~y1~0 != main_~y2~0); 155#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 154#L20-2 [2019-01-01 21:33:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash 920231918, now seen corresponding path program 2 times [2019-01-01 21:33:56,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2019-01-01 21:33:56,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -420389359, now seen corresponding path program 2 times [2019-01-01 21:33:56,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,513 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:56,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:56,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:56,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:56,514 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:56,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:56,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:56,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:33:56,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:56,515 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:56,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:56,748 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:56,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:56,805 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:56,815 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:56,858 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,866 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:56,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:57,025 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:57,027 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:57,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:57,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:57,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:57,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:57,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:57,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:57,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:33:57,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:57,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:57,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,136 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:57,137 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:57,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:57,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:57,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:57,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:57,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:57,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:57,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:57,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:57,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:57,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:57,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:57,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:57,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:57,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:57,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:57,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:57,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:57,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:57,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:57,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:57,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:57,191 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:57,201 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:33:57,202 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:57,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:57,205 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:57,205 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:57,205 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = -1*ULTIMATE.start_main_~y2~0 + 1*ULTIMATE.start_main_~y1~0 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] [2019-01-01 21:33:57,224 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:57,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:33:57,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:33:57,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 14 states and 21 transitions. Complement of second has 6 states. [2019-01-01 21:33:57,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:33:57,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:57,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:57,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:33:57,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:33:57,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 14 states and 21 transitions. Complement of second has 6 states. [2019-01-01 21:33:57,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:33:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:57,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:33:57,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:33:57,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 16 states and 24 transitions. Complement of second has 5 states. [2019-01-01 21:33:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:57,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:57,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:57,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:57,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2019-01-01 21:33:57,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:57,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2019-01-01 21:33:57,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:57,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:57,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-01-01 21:33:57,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:57,608 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:33:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-01-01 21:33:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2019-01-01 21:33:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:33:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:33:57,610 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:33:57,610 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:33:57,610 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:57,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-01 21:33:57,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:57,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:57,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:57,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:57,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:57,612 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 331#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 332#L20-2 [2019-01-01 21:33:57,614 INFO L796 eck$LassoCheckResult]: Loop: 332#L20-2 assume !!(main_~y1~0 != main_~y2~0); 334#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 332#L20-2 [2019-01-01 21:33:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,615 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2019-01-01 21:33:57,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:57,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1382, now seen corresponding path program 1 times [2019-01-01 21:33:57,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:57,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 3 times [2019-01-01 21:33:57,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,712 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:57,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:57,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:57,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:57,713 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:57,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:57,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:57,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:33:57,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:57,714 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:57,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-01 21:33:57,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:57,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:57,901 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:57,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:57,926 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:57,926 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:33:57,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:57,963 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:57,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:58,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:58,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:58,021 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:58,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:58,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:58,031 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:58,053 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:58,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:58,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:58,223 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:58,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:58,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:58,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:58,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:58,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:58,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:58,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:33:58,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:58,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:58,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,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-01 21:33:58,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,350 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:58,351 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:58,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:58,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:58,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:58,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:58,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:58,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:58,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:58,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:58,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:58,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:58,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:58,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:58,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:58,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:58,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:58,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:58,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:58,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:58,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:58,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:58,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:58,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:58,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:58,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:58,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:58,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:58,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:58,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:58,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:58,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:58,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:58,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:58,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:58,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:58,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:58,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:58,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:58,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:58,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:58,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:58,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:58,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:58,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:58,386 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:33:58,386 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:58,387 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:58,388 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:58,388 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:58,388 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = -1*ULTIMATE.start_main_~y1~0 + 1*ULTIMATE.start_main_~y2~0 Supporting invariants [1*ULTIMATE.start_main_~y1~0 - 1 >= 0] [2019-01-01 21:33:58,418 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:58,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:58,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:58,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:58,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:33:58,676 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 12 states and 18 transitions. Complement of second has 5 states. [2019-01-01 21:33:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:33:58,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:33:58,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:58,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:58,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:58,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:58,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:58,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-01-01 21:33:58,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:58,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2019-01-01 21:33:58,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:58,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:58,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2019-01-01 21:33:58,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:58,681 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-01-01 21:33:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2019-01-01 21:33:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-01 21:33:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:33:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-01-01 21:33:58,684 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:33:58,684 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:33:58,684 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:58,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2019-01-01 21:33:58,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:58,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:58,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:58,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:33:58,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:58,688 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 390#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 391#L20-2 assume !!(main_~y1~0 != main_~y2~0); 392#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 397#L20-2 assume !!(main_~y1~0 != main_~y2~0); 395#L20 [2019-01-01 21:33:58,688 INFO L796 eck$LassoCheckResult]: Loop: 395#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 396#L20-2 assume !!(main_~y1~0 != main_~y2~0); 395#L20 [2019-01-01 21:33:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 2 times [2019-01-01 21:33:58,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:58,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 2 times [2019-01-01 21:33:58,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1537641183, now seen corresponding path program 3 times [2019-01-01 21:33:58,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:58,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:58,803 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:58,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:58,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:58,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:58,804 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:58,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:58,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:58,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-01 21:33:58,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:58,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:58,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,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-01 21:33:58,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:58,986 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:58,987 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:58,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:58,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:59,019 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:59,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,028 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:59,028 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:59,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:59,052 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:59,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:59,081 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:59,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:59,122 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:59,128 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:59,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:59,493 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:59,496 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:59,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:59,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:59,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:59,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:59,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:59,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:59,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:59,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-01 21:33:59,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:59,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:59,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:59,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:59,692 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:59,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:59,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:59,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:59,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:59,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:59,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:59,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:59,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:59,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:59,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:59,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:59,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:59,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:59,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:59,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:59,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:59,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:59,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:59,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:59,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:59,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:59,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:59,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:59,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:59,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:33:59,738 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:59,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:59,745 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:33:59,745 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:33:59,827 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:59,858 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:33:59,858 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:33:59,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:59,862 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 21:33:59,862 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:59,862 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0, ULTIMATE.start_main_~y1~0) = 2*ULTIMATE.start_main_~y2~0 - 2*ULTIMATE.start_main_~y1~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y1~0 - 1 >= 0] [2019-01-01 21:33:59,892 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:00,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:00,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:34:00,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 14 states and 18 transitions. Complement of second has 6 states. [2019-01-01 21:34:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-01 21:34:00,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:00,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:00,326 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:00,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:00,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:34:00,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 11 states and 15 transitions. Complement of second has 6 states. [2019-01-01 21:34:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-01 21:34:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:00,559 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:00,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:00,711 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:00,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:34:00,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 17 states and 21 transitions. Complement of second has 5 states. [2019-01-01 21:34:00,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:34:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:34:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:34:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:00,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-01 21:34:00,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:34:00,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2019-01-01 21:34:00,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:34:00,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:34:00,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 21:34:00,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:00,756 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:34:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 21:34:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2019-01-01 21:34:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:34:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:34:00,757 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:34:00,758 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:34:00,758 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:34:00,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-01 21:34:00,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:34:00,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:00,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:00,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:34:00,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:34:00,759 INFO L794 eck$LassoCheckResult]: Stem: 554#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~y1~0, main_~y2~0;havoc main_~y1~0;havoc main_~y2~0;main_~y1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y2~0 := main_#t~nondet1;havoc main_#t~nondet1; 555#L18 assume main_~y1~0 > 0 && main_~y2~0 > 0; 556#L20-2 assume !!(main_~y1~0 != main_~y2~0); 557#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 561#L20-2 assume !!(main_~y1~0 != main_~y2~0); 560#L20 [2019-01-01 21:34:00,759 INFO L796 eck$LassoCheckResult]: Loop: 560#L20 assume !(main_~y1~0 > main_~y2~0);main_~y2~0 := main_~y2~0 - main_~y1~0; 559#L20-2 assume !!(main_~y1~0 != main_~y2~0); 557#L20 assume main_~y1~0 > main_~y2~0;main_~y1~0 := main_~y1~0 - main_~y2~0; 561#L20-2 assume !!(main_~y1~0 != main_~y2~0); 560#L20 [2019-01-01 21:34:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 3 times [2019-01-01 21:34:00,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:00,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1472761, now seen corresponding path program 1 times [2019-01-01 21:34:00,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:00,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:00,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:00,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:00,775 INFO L82 PathProgramCache]: Analyzing trace with hash -204426530, now seen corresponding path program 4 times [2019-01-01 21:34:00,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:00,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:00,999 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-01 21:34:01,013 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:01,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:01,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:01,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:01,013 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:01,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:01,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:01,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:34:01,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:01,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:01,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,159 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:01,159 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:01,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:01,164 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,185 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:01,186 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:01,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:01,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:01,211 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:01,216 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:01,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:01,639 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:01,642 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:01,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:01,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:01,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:01,643 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:01,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:01,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:01,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:01,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:34:01,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:01,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:01,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:01,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:01,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:01,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:01,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:01,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:01,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:01,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:01,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:01,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:01,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:01,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:01,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:01,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:01,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:01,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:01,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:01,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:01,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:01,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:01,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:01,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:01,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:01,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:01,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:01,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:01,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:01,843 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:01,852 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:34:01,855 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:34:01,855 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:01,856 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:01,856 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:01,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y2~0) = 1*ULTIMATE.start_main_~y2~0 Supporting invariants [] [2019-01-01 21:34:01,856 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:02,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:02,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:02,042 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:34:02,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:34:02,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 27 states and 41 transitions. Complement of second has 6 states. [2019-01-01 21:34:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:34:02,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:34:02,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:02,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:34:02,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:02,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 21:34:02,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:02,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2019-01-01 21:34:02,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:02,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-01 21:34:02,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:02,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:02,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:02,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:02,079 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:02,079 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:02,079 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:02,079 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:34:02,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:34:02,079 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:02,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:34:02,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:34:02 BoogieIcfgContainer [2019-01-01 21:34:02,088 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:34:02,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:34:02,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:34:02,089 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:34:02,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52" (3/4) ... [2019-01-01 21:34:02,094 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:34:02,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:34:02,095 INFO L168 Benchmark]: Toolchain (without parser) took 10795.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 952.7 MB in the beginning and 879.8 MB in the end (delta: 72.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:02,097 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:02,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:02,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:02,098 INFO L168 Benchmark]: Boogie Preprocessor took 29.14 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:02,099 INFO L168 Benchmark]: RCFGBuilder took 347.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:02,100 INFO L168 Benchmark]: BuchiAutomizer took 10034.09 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 879.8 MB in the end (delta: 209.5 MB). Peak memory consumption was 289.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:02,101 INFO L168 Benchmark]: Witness Printer took 5.30 ms. Allocated memory is still 1.2 GB. Free memory is still 879.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:02,106 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.14 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 326.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.14 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10034.09 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 879.8 MB in the end (delta: 209.5 MB). Peak memory consumption was 289.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.30 ms. Allocated memory is still 1.2 GB. Free memory is still 879.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One deterministic module has affine ranking function y1 + -1 * y2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + y2 and consists of 3 locations. One deterministic module has affine ranking function y2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y2 + -2 * y1 + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 32 SDtfs, 45 SDslu, 3 SDs, 0 SdLazy, 97 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf92 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf96 smp87 dnf123 smp96 tf100 neg95 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 125ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...