./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_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/CookSeeZuleger-TACAS2013-Fig7a_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 f9de9875f09e594325a645528f016ce12ac5c646 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34:05,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:05,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:05,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:05,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:05,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:05,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:05,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:05,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:05,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:05,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:05,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:05,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:05,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:05,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:05,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:05,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:05,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:05,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:05,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:05,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:05,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:05,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:05,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:05,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:05,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:05,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:05,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:05,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:05,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:05,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:05,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:05,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:05,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:05,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:05,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:05,285 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:34:05,308 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:05,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:05,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:05,314 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:05,314 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:05,314 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:05,314 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:05,315 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:05,315 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:05,315 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:05,315 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:05,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:05,315 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:05,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:05,317 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:05,320 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:05,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:05,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:05,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:05,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:05,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:05,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:05,321 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:05,322 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:05,322 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 -> f9de9875f09e594325a645528f016ce12ac5c646 [2019-01-01 21:34:05,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:05,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:05,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:05,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:05,383 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:05,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2019-01-01 21:34:05,446 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e434ef3de/afc50ef83cb94aa6bc86394130dda381/FLAG75becbb44 [2019-01-01 21:34:05,884 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:05,885 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2019-01-01 21:34:05,891 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e434ef3de/afc50ef83cb94aa6bc86394130dda381/FLAG75becbb44 [2019-01-01 21:34:06,246 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e434ef3de/afc50ef83cb94aa6bc86394130dda381 [2019-01-01 21:34:06,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:06,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:06,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:06,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:06,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:06,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774878b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06, skipping insertion in model container [2019-01-01 21:34:06,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:06,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:06,514 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:06,520 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:06,540 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:06,560 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:06,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06 WrapperNode [2019-01-01 21:34:06,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:06,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:06,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:06,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:06,572 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:34:06" (1/1) ... [2019-01-01 21:34:06,578 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:34:06" (1/1) ... [2019-01-01 21:34:06,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:06,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:06,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:06,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:06,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (1/1) ... [2019-01-01 21:34:06,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:06,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:06,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:06,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:06,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (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:34:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:06,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:06,958 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:06,959 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:34:06,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:06 BoogieIcfgContainer [2019-01-01 21:34:06,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:06,960 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:06,960 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:06,964 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:06,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:06,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:06" (1/3) ... [2019-01-01 21:34:06,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@689dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:06, skipping insertion in model container [2019-01-01 21:34:06,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:06,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:06" (2/3) ... [2019-01-01 21:34:06,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@689dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:06, skipping insertion in model container [2019-01-01 21:34:06,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:06,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:06" (3/3) ... [2019-01-01 21:34:06,968 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2019-01-01 21:34:07,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:07,079 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:07,079 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:07,079 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:07,079 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:07,079 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:07,080 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:07,080 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:07,080 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:07,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:34:07,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:07,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:07,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:07,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:07,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:07,164 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:07,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:34:07,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:07,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:07,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:07,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:07,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:07,182 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 7#L21-2true [2019-01-01 21:34:07,183 INFO L796 eck$LassoCheckResult]: Loop: 7#L21-2true assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 3#L21true assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L21-2true [2019-01-01 21:34:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:34:07,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:07,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:34:07,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:34:07,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:07,520 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:07,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:07,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:07,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:07,522 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:07,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:07,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:07,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:07,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:07,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:07,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:07,551 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:07,598 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:07,611 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:07,630 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:07,641 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:07,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:08,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:08,041 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:34:08,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:08,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:08,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:08,075 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:08,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:08,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:08,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:08,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:08,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:08,114 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:08,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:08,158 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:08,185 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:08,187 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:08,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:08,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:08,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:08,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:08,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:08,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:08,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:08,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:08,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:08,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:08,191 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:08,213 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:08,220 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:08,240 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:08,245 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:08,264 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:08,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:08,519 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:08,521 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:08,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:08,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:08,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:08,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:08,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:08,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:08,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:08,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:08,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:08,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:08,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:08,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:08,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:08,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:08,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:08,554 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:08,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:08,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:08,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:08,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:08,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:08,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:08,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:08,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:08,569 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:08,569 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:08,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:08,572 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:08,572 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:08,573 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:08,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:08,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:08,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:08,934 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:08,949 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:08,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:34:09,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2019-01-01 21:34:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:34:09,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:34:09,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:09,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:34:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:09,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:34:09,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:09,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:34:09,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:34:09,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:34:09,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:34:09,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:09,038 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:34:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:34:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:34:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:34:09,067 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:09,067 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:09,068 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:09,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:34:09,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:09,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:09,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:09,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:34:09,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:09,069 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 72#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 67#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 68#L21-2 [2019-01-01 21:34:09,070 INFO L796 eck$LassoCheckResult]: Loop: 68#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 73#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 68#L21-2 [2019-01-01 21:34:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:34:09,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:34:09,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-01 21:34:09,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:09,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:09,168 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:09,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:09,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:09,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:09,169 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:09,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:09,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:09,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:09,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:09,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:09,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:09,173 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:09,179 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:09,191 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:09,200 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:09,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:34:09,294 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:09,537 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:34:09,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:09,800 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:09,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:09,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:09,827 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:09,827 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:09,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:09,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:09,840 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:09,840 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Honda state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:34:09,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:09,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:09,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:09,878 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:34:09,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:09,909 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:09,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:09,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:09,970 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:09,972 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:09,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:09,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:09,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:09,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:09,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:09,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:09,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:09,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:09,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:09,973 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:09,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:09,984 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:10,006 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:10,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:10,057 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:10,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:10,260 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:10,261 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:10,262 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:10,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:10,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:10,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:10,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:10,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:10,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:10,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:10,272 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:10,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:10,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:10,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:10,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:10,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:10,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:10,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:10,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:10,284 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:10,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:10,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:10,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:10,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:10,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:10,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:10,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:10,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:10,295 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:10,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:10,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:10,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:10,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:10,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:10,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:10,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:10,304 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:10,309 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:10,309 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:10,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:10,310 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:10,310 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:10,310 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:10,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:10,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:10,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:10,557 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:10,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:10,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:34:10,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:34:10,579 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:34:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:34:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:10,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:10,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:10,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:10,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:34:10,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:10,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:34:10,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:10,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:34:10,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:34:10,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:34:10,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:34:10,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:10,587 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:34:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:34:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:34:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:34:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:34:10,589 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:34:10,590 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:34:10,590 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:10,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-01 21:34:10,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:10,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:10,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:10,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:34:10,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:10,591 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 126#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 121#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 122#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 129#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 127#L21-2 [2019-01-01 21:34:10,592 INFO L796 eck$LassoCheckResult]: Loop: 127#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 128#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 127#L21-2 [2019-01-01 21:34:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-01 21:34:10,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:10,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-01 21:34:10,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:10,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-01 21:34:10,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:10,716 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:10,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:10,716 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:10,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:10,716 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:10,716 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:10,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:10,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:10,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:10,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:10,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:10,720 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:10,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:10,730 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:10,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:10,753 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:10,756 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:10,879 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:10,879 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:10,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:10,883 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:10,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:10,888 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} 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:34:10,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:10,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:10,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:10,938 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:34:10,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:10,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:10,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:10,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Honda state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:34:10,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:10,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:10,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:10,989 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:10,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:10,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:11,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:11,014 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:11,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:11,019 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:11,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:11,050 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:11,079 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:11,081 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:11,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:11,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:11,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:11,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:11,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:11,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:11,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:11,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:11,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:11,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:11,084 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:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:11,172 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:11,175 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:11,189 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:11,335 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:11,335 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:11,336 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:11,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:11,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,340 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:11,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:11,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:11,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:11,348 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:11,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:11,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:11,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:11,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:11,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:34:11,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:11,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:11,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:11,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:11,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:11,370 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:11,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:11,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:11,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:11,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:11,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:11,376 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:11,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:11,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:11,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:11,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:11,386 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:11,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:11,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:11,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:11,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:11,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:11,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:11,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:11,395 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:11,398 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:11,398 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:11,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:11,398 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:11,399 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:11,399 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:11,399 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,462 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:11,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:11,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:34:11,484 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:34:11,486 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:34:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:34:11,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:11,487 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,578 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:11,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:11,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:34:11,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:34:11,594 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:34:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:34:11,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:11,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:11,596 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:11,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:11,640 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:11,640 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:11,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:34:11,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-01 21:34:11,663 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:34:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:34:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:11,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:34:11,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:34:11,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:11,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-01 21:34:11,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:11,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-01 21:34:11,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:34:11,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:34:11,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:34:11,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:11,667 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:34:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:34:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-01 21:34:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:34:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-01 21:34:11,668 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:34:11,669 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:34:11,669 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:11,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-01 21:34:11,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:11,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:11,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:11,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:11,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:11,670 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 269#L21-2 [2019-01-01 21:34:11,670 INFO L796 eck$LassoCheckResult]: Loop: 269#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 268#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 269#L21-2 [2019-01-01 21:34:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:34:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-01 21:34:11,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-01 21:34:11,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:11,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:11,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:11,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:11,773 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:11,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:11,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:11,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:11,774 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:11,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:11,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:11,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:11,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:34:11,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:11,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:11,777 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:11,805 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:11,812 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:11,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:34:11,824 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:11,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:34:11,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:11,926 INFO L412 LassoAnalysis]: Checking for nontermination... 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:34:11,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:11,930 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:34:11,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:11,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:11,981 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:11,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:11,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:11,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:11,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:11,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:11,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:11,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:11,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:11,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:34:11,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:11,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:11,986 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:11,996 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:12,004 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:12,014 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:12,028 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:12,033 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:12,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:12,134 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:12,135 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:12,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:12,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:12,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:12,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:12,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:12,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:12,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:12,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:12,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:12,149 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:12,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:12,151 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:12,151 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:12,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2019-01-01 21:34:12,153 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,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:34:12,217 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:12,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:34:12,234 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:34:12,236 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:34:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-01 21:34:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:34:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:34:12,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:12,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-01 21:34:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:12,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-01 21:34:12,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:34:12,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:34:12,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-01 21:34:12,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:12,242 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:34:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-01 21:34:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:34:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:34:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-01 21:34:12,243 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:34:12,243 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:34:12,243 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:34:12,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-01 21:34:12,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:12,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:12,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:12,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:34:12,248 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:12,249 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 319#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 320#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 321#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2019-01-01 21:34:12,249 INFO L796 eck$LassoCheckResult]: Loop: 314#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 315#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2019-01-01 21:34:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:34:12,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:34:12,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:12,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 3 times [2019-01-01 21:34:12,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:12,332 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:12,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:12,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:12,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:12,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:12,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:12,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:12,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:12,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:34:12,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:12,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:12,337 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:12,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:12,354 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:12,356 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:12,365 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:12,382 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:12,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:12,458 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:12,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:12,463 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:34:12,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:12,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:12,561 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:12,563 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:12,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:12,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:12,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:12,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:12,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:12,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:12,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:12,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:34:12,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:12,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:12,569 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:12,573 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:12,580 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:12,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:12,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:12,598 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:12,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:12,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:12,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:34:12,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:12,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:12,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:12,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:12,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:12,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:12,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:12,716 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:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:12,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:12,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:12,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:12,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:12,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:12,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:12,720 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:12,723 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:12,724 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:12,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:12,724 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:12,724 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:12,724 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2019-01-01 21:34:12,725 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,808 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:12,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:12,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:34:12,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:34:12,833 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:34:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:34:12,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:12,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:12,835 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,909 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:12,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:12,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:34:12,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:34:12,937 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:34:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:34:12,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:12,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:12,938 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:12,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:13,011 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:13,011 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:13,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:34:13,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 4 states. [2019-01-01 21:34:13,036 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:34:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:34:13,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:13,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:34:13,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:34:13,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-01-01 21:34:13,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:34:13,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 16 transitions. [2019-01-01 21:34:13,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:34:13,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:34:13,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:34:13,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:13,042 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:34:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:34:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2019-01-01 21:34:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:34:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:34:13,045 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:13,045 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:13,045 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:34:13,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:34:13,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:34:13,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:13,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:13,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:34:13,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:34:13,046 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 446#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2019-01-01 21:34:13,046 INFO L796 eck$LassoCheckResult]: Loop: 441#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 442#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2019-01-01 21:34:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 3 times [2019-01-01 21:34:13,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:13,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-01 21:34:13,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:13,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 602329151, now seen corresponding path program 4 times [2019-01-01 21:34:13,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:13,203 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:13,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:13,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:13,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:13,204 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:13,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:13,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:13,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:13,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:34:13,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:13,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:13,207 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:13,213 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:13,217 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:13,222 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:13,229 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:13,240 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:13,344 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:13,345 INFO L412 LassoAnalysis]: Checking for nontermination... 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:34:13,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:13,349 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:34:13,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:13,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:13,430 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:13,432 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:13,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:13,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:13,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:13,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:13,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:13,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:13,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:13,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:34:13,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:13,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:13,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:13,442 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:13,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:13,449 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:13,457 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:13,460 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:13,541 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:13,542 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:13,542 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:13,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:13,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:13,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:13,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:13,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:13,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:13,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:13,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:13,549 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:13,550 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:13,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:13,550 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:13,550 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:13,551 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:34:13,551 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:13,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:13,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:13,685 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:13,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:34:13,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2019-01-01 21:34:13,719 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:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:34:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:34:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:34:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:34:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:13,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2019-01-01 21:34:13,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:13,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-01-01 21:34:13,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:13,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:13,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:13,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:13,723 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:13,723 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:13,723 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:13,723 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:34:13,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:34:13,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:13,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:34:13,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:34:13 BoogieIcfgContainer [2019-01-01 21:34:13,731 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:34:13,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:34:13,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:34:13,732 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:34:13,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:06" (3/4) ... [2019-01-01 21:34:13,737 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:34:13,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:34:13,738 INFO L168 Benchmark]: Toolchain (without parser) took 7487.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -82.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:13,739 INFO L168 Benchmark]: CDTParser took 0.57 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:13,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:13,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.36 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:13,741 INFO L168 Benchmark]: Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:13,741 INFO L168 Benchmark]: RCFGBuilder took 323.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:13,742 INFO L168 Benchmark]: BuchiAutomizer took 6771.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.6 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:13,743 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:13,748 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.57 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 308.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.36 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6771.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.6 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function d and consists of 3 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function d and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.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, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 41 SDtfs, 27 SDslu, 8 SDs, 0 SdLazy, 57 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax147 hnf100 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...