./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_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/PodelskiRybalchenko-TACAS2011-Fig4_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 e09e2fe0d9f978fd259d1d805e514754ab2def67 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:17:11,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:17:11,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:17:11,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:17:11,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:17:11,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:17:11,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:17:11,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:17:11,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:17:11,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:17:11,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:17:11,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:17:11,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:17:11,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:17:11,707 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:17:11,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:17:11,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:17:11,712 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:17:11,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:17:11,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:17:11,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:17:11,718 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:17:11,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:17:11,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:17:11,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:17:11,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:17:11,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:17:11,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:17:11,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:17:11,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:17:11,727 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:17:11,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:17:11,728 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:17:11,728 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:17:11,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:17:11,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:17:11,730 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:17:11,747 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:17:11,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:17:11,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:17:11,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:17:11,749 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:17:11,750 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:17:11,750 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:17:11,750 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:17:11,750 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:17:11,750 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:17:11,750 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:17:11,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:17:11,752 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:17:11,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:17:11,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:17:11,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:17:11,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:17:11,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:17:11,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:17:11,753 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:17:11,753 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:17:11,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:17:11,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:17:11,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:17:11,754 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:17:11,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:17:11,754 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:17:11,754 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:17:11,755 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:17:11,755 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 -> e09e2fe0d9f978fd259d1d805e514754ab2def67 [2019-01-14 02:17:11,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:17:11,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:17:11,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:17:11,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:17:11,812 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:17:11,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-14 02:17:11,872 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053b737a4/16a2100ac21844fc90127b2ce037fdd0/FLAG7c9237eab [2019-01-14 02:17:12,286 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:17:12,287 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-14 02:17:12,294 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053b737a4/16a2100ac21844fc90127b2ce037fdd0/FLAG7c9237eab [2019-01-14 02:17:12,674 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053b737a4/16a2100ac21844fc90127b2ce037fdd0 [2019-01-14 02:17:12,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:17:12,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:17:12,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:12,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:17:12,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:17:12,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326e2392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12, skipping insertion in model container [2019-01-14 02:17:12,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:17:12,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:17:12,902 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:12,907 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:17:12,925 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:12,941 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:17:12,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12 WrapperNode [2019-01-14 02:17:12,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:12,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:12,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:17:12,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:17:12,954 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:17:12" (1/1) ... [2019-01-14 02:17:12,959 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:17:12" (1/1) ... [2019-01-14 02:17:12,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:12,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:17:12,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:17:12,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:17:12,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:12,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:13,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:13,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (1/1) ... [2019-01-14 02:17:13,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:17:13,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:17:13,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:17:13,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:17:13,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (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:17:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:17:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:17:13,305 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:17:13,305 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:17:13,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:13 BoogieIcfgContainer [2019-01-14 02:17:13,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:17:13,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:17:13,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:17:13,311 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:17:13,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:13,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:17:12" (1/3) ... [2019-01-14 02:17:13,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52a5f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:13, skipping insertion in model container [2019-01-14 02:17:13,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:13,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:12" (2/3) ... [2019-01-14 02:17:13,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52a5f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:13, skipping insertion in model container [2019-01-14 02:17:13,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:13,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:13" (3/3) ... [2019-01-14 02:17:13,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-14 02:17:13,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:17:13,376 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:17:13,376 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:17:13,376 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:17:13,376 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:17:13,376 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:17:13,376 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:17:13,377 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:17:13,377 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:17:13,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:17:13,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:13,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:13,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:13,420 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:13,420 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:13,420 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:17:13,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:17:13,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:13,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:13,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:13,422 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:13,422 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:13,430 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_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 5#L18-2true [2019-01-14 02:17:13,431 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7#L18true assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 5#L18-2true [2019-01-14 02:17:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:17:13,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:13,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:17:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:17:13,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:13,713 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:17:13,776 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:13,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:13,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:13,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:13,779 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:13,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:13,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:13,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:13,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:13,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:13,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:13,851 INFO 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:17:13,856 INFO 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:17:13,878 INFO 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:17:14,260 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:14,261 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:17:14,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:14,275 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:14,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:14,306 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:17:14,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:14,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:14,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:14,335 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:17:14,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:14,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:14,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:14,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:17:14,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:14,368 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:17:14,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:14,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:14,443 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:14,445 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:14,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:14,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:14,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:14,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:14,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:14,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:14,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:14,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:14,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:14,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:14,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:14,489 INFO 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:17:14,501 INFO 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:17:14,508 INFO 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:17:14,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:17:14,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:14,771 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:14,773 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:17:14,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:14,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:14,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:14,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:14,790 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:17:14,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:14,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:14,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:14,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:14,805 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:17:14,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:14,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,806 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:17:14,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:17:14,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:14,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:14,815 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:17:14,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:14,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:14,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:14,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:14,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:14,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:14,829 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:14,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:14,831 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:14,831 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:14,831 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:17:14,833 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:15,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:15,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:15,346 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:17:15,365 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:17:15,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:17:15,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:17:15,590 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:17:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-14 02:17:15,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:17:15,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:15,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:17:15,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:15,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:17:15,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:15,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-14 02:17:15,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:15,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-14 02:17:15,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:17:15,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:17:15,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-14 02:17:15,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:15,610 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:17:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-14 02:17:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-14 02:17:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:17:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:17:15,633 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:17:15,633 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:17:15,633 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:17:15,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:17:15,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:15,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:15,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:15,635 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:17:15,635 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:15,635 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_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 72#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 74#L18 [2019-01-14 02:17:15,635 INFO L796 eck$LassoCheckResult]: Loop: 74#L18 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 73#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 74#L18 [2019-01-14 02:17:15,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:17:15,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:15,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-14 02:17:15,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:15,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:15,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:15,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 1 times [2019-01-14 02:17:15,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:15,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:15,744 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:15,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:15,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:15,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:15,744 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:15,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:15,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:15,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:15,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:15,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:15,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:15,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:15,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:17:15,771 INFO 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:17:15,781 INFO 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:17:16,173 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:17:16,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:16,261 INFO L412 LassoAnalysis]: Checking for nontermination... 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:17:16,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:16,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:16,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:16,292 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 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:17:16,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:16,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:16,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:16,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} 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:17:16,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:16,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:16,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:16,345 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=1} Honda state: {ULTIMATE.start_main_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:16,353 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:17:16,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:16,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:16,433 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:16,435 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:16,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:16,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:16,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:16,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:16,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:16,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:16,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:16,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:16,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:16,440 INFO 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:17:16,451 INFO 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:17:16,466 INFO 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:17:16,471 INFO 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:17:16,484 INFO 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:17:16,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:16,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:16,648 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:17:16,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:16,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:16,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:16,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:16,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:16,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:16,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:16,658 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:17:16,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:16,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:16,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:16,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:16,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:16,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:16,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:16,680 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:17:16,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:16,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:16,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:16,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:16,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:16,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:16,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:16,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:16,687 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:17:16,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:16,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:16,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:16,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:16,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:16,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:16,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:16,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:16,700 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:16,700 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:16,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:16,700 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:16,701 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:16,701 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:17:16,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:16,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:16,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:16,776 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:17:16,777 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:17:16,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:17:16,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 19 transitions. Complement of second has 5 states. [2019-01-14 02:17:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:17:16,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:17:16,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:16,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:17:16,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 02:17:16,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:16,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 12 transitions. [2019-01-14 02:17:16,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:17:16,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:17:16,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-14 02:17:16,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:16,827 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 02:17:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-14 02:17:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-14 02:17:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:17:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:17:16,829 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:17:16,829 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:17:16,829 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:17:16,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:17:16,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:16,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:16,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:16,831 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:17:16,831 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:16,831 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 125#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 126#L18 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 131#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 129#L18 [2019-01-14 02:17:16,831 INFO L796 eck$LassoCheckResult]: Loop: 129#L18 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 130#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 129#L18 [2019-01-14 02:17:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:17:16,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:16,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:17:16,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 1 times [2019-01-14 02:17:16,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,899 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:16,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:16,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:16,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:16,900 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:16,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:16,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:16,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:16,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:16,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:16,902 INFO 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:17:16,912 INFO 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:17:16,921 INFO 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:17:16,925 INFO 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:17:16,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:17:17,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:17,033 INFO L412 LassoAnalysis]: Checking for nontermination... 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:17:17,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:17,037 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:17,063 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:17,124 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:17,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:17,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:17,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:17,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:17,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:17,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:17,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:17,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:17,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:17,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:17,130 INFO 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:17:17,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:17,180 INFO 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:17:17,187 INFO 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:17:17,190 INFO 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:17:17,271 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:17,272 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:17,273 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:17:17,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:17,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:17,282 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:17,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:17,282 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:17,282 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:17,282 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:17:17,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,347 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:17:17,348 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:17:17,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:17:17,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-14 02:17:17,401 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:17:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:17:17,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:17,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:17,403 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,483 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:17:17,484 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:17:17,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:17:17,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-14 02:17:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:17:17,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:17,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:17,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:17,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:17,622 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:17:17,623 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:17:17,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:17:17,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 4 states. [2019-01-14 02:17:17,645 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:17:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:17:17,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:17,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:17,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:17:17,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:17,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:17:17,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:17,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-14 02:17:17,648 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:17,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2019-01-14 02:17:17,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:17,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:17,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:17,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:17,649 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:17,649 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:17,649 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:17,649 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:17:17,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:17:17,649 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:17,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:17:17,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:17:17 BoogieIcfgContainer [2019-01-14 02:17:17,656 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:17:17,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:17:17,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:17:17,657 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:17:17,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:13" (3/4) ... [2019-01-14 02:17:17,661 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:17:17,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:17:17,662 INFO L168 Benchmark]: Toolchain (without parser) took 4984.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 951.4 MB in the beginning and 883.4 MB in the end (delta: 67.9 MB). Peak memory consumption was 191.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:17,663 INFO L168 Benchmark]: CDTParser took 0.16 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:17:17,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.17 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:17:17,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.80 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:17:17,666 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 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:17:17,666 INFO L168 Benchmark]: RCFGBuilder took 302.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:17,667 INFO L168 Benchmark]: BuchiAutomizer took 4349.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.4 MB in the end (delta: 219.7 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:17,668 INFO L168 Benchmark]: Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 883.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:17,673 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.16 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 262.17 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 37.80 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 23.07 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 302.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4349.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.4 MB in the end (delta: 219.7 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 883.4 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 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 18 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax169 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...