./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-0ed9222-m [2019-01-14 02:16:32,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:32,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:32,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:32,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:32,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:32,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:32,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:32,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:32,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:32,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:32,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:32,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:32,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:32,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:32,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:32,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:32,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:32,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:32,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:32,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:32,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:32,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:32,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:32,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:32,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:32,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:32,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:32,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:32,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:32,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:32,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:32,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:32,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:32,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:32,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:32,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:16:32,442 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:32,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:32,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:32,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:32,444 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:32,444 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:32,444 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:32,444 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:32,444 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:32,445 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:32,445 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:32,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:32,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:32,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:32,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:32,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:32,449 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:32,449 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:32,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:32,449 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:32,450 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:32,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:32,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:32,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:32,450 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:32,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:32,451 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:32,451 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:32,453 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:32,453 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-14 02:16:32,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:32,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:32,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:32,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:32,538 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:32,538 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-14 02:16:32,586 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c056bd085/f212362abdab4edd994dc21f5f9910a5/FLAG2febeed67 [2019-01-14 02:16:33,004 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:33,004 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2019-01-14 02:16:33,011 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c056bd085/f212362abdab4edd994dc21f5f9910a5/FLAG2febeed67 [2019-01-14 02:16:33,391 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c056bd085/f212362abdab4edd994dc21f5f9910a5 [2019-01-14 02:16:33,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:33,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:33,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:33,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:33,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:33,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a569fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33, skipping insertion in model container [2019-01-14 02:16:33,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:33,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:33,658 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:33,663 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:33,684 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:33,700 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:33,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33 WrapperNode [2019-01-14 02:16:33,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:33,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:33,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:33,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:33,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:33,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:33,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:33,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:33,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... [2019-01-14 02:16:33,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:33,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:33,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:33,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:33,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:33,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:34,043 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:34,043 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:16:34,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:34 BoogieIcfgContainer [2019-01-14 02:16:34,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:34,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:34,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:34,048 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:34,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:34,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:33" (1/3) ... [2019-01-14 02:16:34,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64fd7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:34, skipping insertion in model container [2019-01-14 02:16:34,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:34,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:33" (2/3) ... [2019-01-14 02:16:34,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64fd7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:34, skipping insertion in model container [2019-01-14 02:16:34,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:34,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:34" (3/3) ... [2019-01-14 02:16:34,054 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2019-01-14 02:16:34,129 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:34,129 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:34,130 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:34,130 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:34,130 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:34,130 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:34,130 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:34,130 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:34,130 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:34,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:16:34,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:34,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:34,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:34,193 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:16:34,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:34,194 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:34,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:16:34,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:34,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:34,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:34,197 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:16:34,197 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:34,208 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-14 02:16:34,209 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-14 02:16:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:16:34,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:34,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:16:34,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:34,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:34,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:34,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:16:34,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:34,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:34,487 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:34,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:34,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:34,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:34,489 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:34,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:34,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:34,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:34,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:34,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:34,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:34,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:34,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:34,916 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-14 02:16:34,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:34,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:34,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:34,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:34,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:34,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:34,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:34,986 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-14 02:16:34,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:34,992 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-14 02:16:35,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:35,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:35,044 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:35,046 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:35,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:35,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:35,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:35,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:35,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:35,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:35,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:35,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:35,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:35,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:35,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:35,361 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:35,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:35,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:35,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:35,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:35,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:35,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:35,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:35,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:35,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:35,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:35,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:35,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:35,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:35,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:35,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:35,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:35,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:35,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:35,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:35,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:35,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:35,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:35,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:35,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:35,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:35,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:35,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:35,419 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:35,421 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:35,421 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:35,425 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:35,426 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:16:35,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:35,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:35,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:35,634 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:35,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:16:35,817 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-14 02:16:35,818 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-14 02:16:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:16:35,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:16:35,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:35,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:35,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:35,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:16:35,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:35,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:16:35,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:35,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:16:35,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:16:35,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:16:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:16:35,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:35,841 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:16:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:16:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:16:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:16:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:16:35,873 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:16:35,873 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:16:35,874 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:35,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:16:35,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:35,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:35,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:35,876 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:35,876 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:35,877 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-14 02:16:35,877 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-14 02:16:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:16:35,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:35,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:16:35,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-14 02:16:35,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:36,034 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:36,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:36,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:36,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:36,034 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:36,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:36,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:36,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:36,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:36,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:36,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:36,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,439 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 02:16:36,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:36,626 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:36,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:36,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:36,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:36,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:36,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:36,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:36,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:36,665 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-14 02:16:36,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:36,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:36,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:36,704 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-14 02:16:36,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:36,728 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:36,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:36,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:36,781 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:36,784 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:36,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:36,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:36,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:36,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:36,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:36,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:36,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:36,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:16:36,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:36,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:36,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:36,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,028 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:37,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:37,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:37,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:37,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:37,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:37,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:37,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:37,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:37,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:37,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:37,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:37,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:37,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:37,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:37,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:37,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:37,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:37,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:37,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:37,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:37,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:37,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:37,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:16:37,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:37,051 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:16:37,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:37,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:37,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:37,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:37,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:37,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:37,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:37,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:37,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:37,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:37,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:37,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:37,065 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:37,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:37,066 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:37,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:37,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:16:37,067 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:37,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:37,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:37,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:37,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:16:37,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:16:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:37,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:37,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:37,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:16:37,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:37,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:16:37,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:37,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:16:37,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:37,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:16:37,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:16:37,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:16:37,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:16:37,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:37,346 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:16:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:16:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:16:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:16:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:16:37,348 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:16:37,348 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:16:37,348 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:16:37,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-14 02:16:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:16:37,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:37,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:37,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:16:37,350 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:37,350 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-14 02:16:37,351 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-14 02:16:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-14 02:16:37,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:37,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-14 02:16:37,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:37,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-14 02:16:37,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:37,468 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:37,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:37,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:37,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:37,469 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:37,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:37,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:37,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:37,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:37,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:37,470 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:37,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:37,643 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:37,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,657 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:37,657 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-14 02:16:37,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,702 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:37,702 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-14 02:16:37,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,712 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:37,713 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-14 02:16:37,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:37,756 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-14 02:16:37,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,782 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:37,782 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-14 02:16:37,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:37,787 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:37,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:37,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:37,849 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:37,850 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:37,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:37,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:37,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:37,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:37,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:37,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:37,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:37,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:16:37,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:37,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:37,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:37,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:38,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:38,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:38,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:16:38,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,098 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:16:38,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:38,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:38,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:38,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:38,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:38,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:38,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:38,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:38,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:38,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:38,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:38,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:38,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:38,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:38,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:38,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:38,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:38,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:38,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:38,145 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:38,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:38,148 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:38,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:38,149 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:38,150 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:38,150 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:16:38,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:38,233 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:38,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:16:38,249 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-14 02:16:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:38,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:16:38,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,252 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:38,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:38,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:16:38,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-14 02:16:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:16:38,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:16:38,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,328 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:38,378 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:38,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:16:38,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-14 02:16:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:16:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:16:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:16:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:16:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-14 02:16:38,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:38,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-14 02:16:38,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:16:38,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:16:38,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-14 02:16:38,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:38,402 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:16:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-14 02:16:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-14 02:16:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:16:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-14 02:16:38,403 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:16:38,403 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:16:38,404 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:16:38,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-14 02:16:38,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:38,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:38,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:38,405 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:16:38,405 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:38,405 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-14 02:16:38,405 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-14 02:16:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,405 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:16:38,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:38,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-14 02:16:38,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:38,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-14 02:16:38,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:38,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:38,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:38,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:38,508 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:38,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:38,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:38,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:38,509 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:38,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:38,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:38,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:38,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:38,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:38,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:38,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:38,666 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-14 02:16:38,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:38,671 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-14 02:16:38,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:38,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:38,745 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:38,747 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:38,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:38,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:38,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:38,747 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:38,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:38,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:38,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:38,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:16:38,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:38,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:38,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:38,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:38,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:38,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:38,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:38,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:38,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:38,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:38,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:38,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:38,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:38,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:38,892 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:38,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:38,893 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:38,893 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:38,893 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-14 02:16:38,893 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:38,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:38,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:38,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:16:38,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:16:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-14 02:16:38,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:16:38,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:38,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:16:38,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:38,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-14 02:16:38,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:38,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-14 02:16:38,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:16:38,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:16:38,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:16:38,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:38,998 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:16:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:16:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 02:16:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:16:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-14 02:16:39,002 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:16:39,002 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:16:39,002 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:39,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-14 02:16:39,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:39,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:39,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:39,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:16:39,007 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:16:39,007 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-14 02:16:39,007 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-14 02:16:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:16:39,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:16:39,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 3 times [2019-01-14 02:16:39,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,087 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:39,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:39,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:39,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:39,088 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:39,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:39,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:39,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:39,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:16:39,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:39,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:39,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:39,215 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-14 02:16:39,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:39,220 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-14 02:16:39,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:39,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:39,311 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:39,313 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:39,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:39,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:39,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:39,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:39,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:39,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:39,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:39,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:16:39,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:39,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:39,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:39,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:39,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:39,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:39,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:39,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:39,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:39,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:39,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:39,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:39,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:39,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:39,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:39,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:39,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:39,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:39,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:39,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:39,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:39,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:39,497 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:39,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:39,497 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:39,497 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:39,498 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-14 02:16:39,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:39,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:39,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:16:39,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-14 02:16:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:16:39,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:39,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:39,633 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:39,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:39,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:16:39,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-14 02:16:39,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:16:39,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:39,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:39,728 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:39,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:39,789 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:16:39,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:16:39,817 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-14 02:16:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:16:39,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:39,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:39,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:16:39,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:39,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:16:39,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:39,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-01-14 02:16:39,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:16:39,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 16 transitions. [2019-01-14 02:16:39,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:16:39,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:16:39,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:16:39,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:39,824 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:16:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:16:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2019-01-14 02:16:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:16:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:16:39,828 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:16:39,828 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:16:39,828 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:16:39,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:16:39,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:16:39,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:39,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:39,831 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:16:39,831 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:16:39,831 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-14 02:16:39,831 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-14 02:16:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 3 times [2019-01-14 02:16:39,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-14 02:16:39,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 602329151, now seen corresponding path program 4 times [2019-01-14 02:16:39,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:39,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:39,967 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:39,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:39,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:39,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:39,967 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:39,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:39,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:39,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:39,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:16:39,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:39,968 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:39,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:39,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-14 02:16:40,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:40,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:40,121 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-14 02:16:40,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:40,125 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-14 02:16:40,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:40,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:40,204 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:40,207 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:40,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:40,207 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:40,207 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:40,207 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:40,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:40,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:40,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:40,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:16:40,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:40,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:40,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:40,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:40,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-14 02:16:40,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:40,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-14 02:16:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:40,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:40,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:40,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:16:40,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:40,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:40,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:40,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:40,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:40,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:40,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:40,321 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:40,323 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:40,324 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:40,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:40,324 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:40,324 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:40,324 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-14 02:16:40,327 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:40,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:40,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:40,395 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-14 02:16:40,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:16:40,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:16:40,424 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-14 02:16:40,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 02:16:40,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:16:40,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:40,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:16:40,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:40,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 02:16:40,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:40,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2019-01-14 02:16:40,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:40,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-01-14 02:16:40,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:40,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:40,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:40,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:40,433 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:40,433 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:40,433 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:40,433 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:16:40,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:40,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:40,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:40,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:40 BoogieIcfgContainer [2019-01-14 02:16:40,442 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:40,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:40,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:40,443 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:40,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:34" (3/4) ... [2019-01-14 02:16:40,447 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:40,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:40,448 INFO L168 Benchmark]: Toolchain (without parser) took 7053.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 951.4 MB in the beginning and 976.5 MB in the end (delta: -25.1 MB). Peak memory consumption was 142.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:40,449 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:40,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:40,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.08 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:40,451 INFO L168 Benchmark]: Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:40,451 INFO L168 Benchmark]: RCFGBuilder took 292.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:40,452 INFO L168 Benchmark]: BuchiAutomizer took 6397.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 976.5 MB in the end (delta: 74.8 MB). Peak memory consumption was 165.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:40,453 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 976.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:40,457 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.13 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 304.77 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 32.08 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 17.82 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 292.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6397.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 976.5 MB in the end (delta: 74.8 MB). Peak memory consumption was 165.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 976.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 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.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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.2s 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: 19ms 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...