./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_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/UrbanMine-ESOP2014-Fig3_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 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:17:20,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:17:20,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:17:20,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:17:20,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:17:20,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:17:20,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:17:20,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:17:20,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:17:20,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:17:20,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:17:20,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:17:20,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:17:20,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:17:20,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:17:20,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:17:20,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:17:20,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:17:20,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:17:20,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:17:20,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:17:20,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:17:20,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:17:20,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:17:20,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:17:20,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:17:20,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:17:20,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:17:20,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:17:20,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:17:20,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:17:20,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:17:20,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:17:20,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:17:20,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:17:20,229 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:20,263 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:17:20,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:17:20,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:17:20,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:17:20,265 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:17:20,265 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:17:20,265 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:17:20,266 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:17:20,267 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:17:20,267 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:17:20,267 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:17:20,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:17:20,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:17:20,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:17:20,269 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:17:20,269 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:17:20,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:17:20,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:17:20,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:17:20,270 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:17:20,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:17:20,270 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:17:20,270 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:17:20,273 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:17:20,273 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 -> 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 [2019-01-14 02:17:20,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:17:20,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:17:20,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:17:20,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:17:20,353 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:17:20,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 02:17:20,425 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a167263b/1c9f318c8690440bbc1ac34092091d8b/FLAG0f6e4a9b2 [2019-01-14 02:17:20,891 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:17:20,892 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 02:17:20,899 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a167263b/1c9f318c8690440bbc1ac34092091d8b/FLAG0f6e4a9b2 [2019-01-14 02:17:21,275 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a167263b/1c9f318c8690440bbc1ac34092091d8b [2019-01-14 02:17:21,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:17:21,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:17:21,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:21,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:17:21,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:17:21,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:21" (1/1) ... [2019-01-14 02:17:21,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:21, skipping insertion in model container [2019-01-14 02:17:21,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:21" (1/1) ... [2019-01-14 02:17:21,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:17:21,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:17:21,473 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:21,477 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:17:21,494 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:21,506 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:17:21,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:21 WrapperNode [2019-01-14 02:17:21,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:21,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:21,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:17:21,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:17:21,517 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:21" (1/1) ... [2019-01-14 02:17:21,522 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:21" (1/1) ... [2019-01-14 02:17:21,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:21,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:17:21,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:17:21,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:17:21,556 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:21" (1/1) ... [2019-01-14 02:17:21,556 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:21" (1/1) ... [2019-01-14 02:17:21,557 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:21" (1/1) ... [2019-01-14 02:17:21,557 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:21" (1/1) ... [2019-01-14 02:17:21,559 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:21" (1/1) ... [2019-01-14 02:17:21,566 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:21" (1/1) ... [2019-01-14 02:17:21,567 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:21" (1/1) ... [2019-01-14 02:17:21,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:17:21,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:17:21,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:17:21,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:17:21,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:21" (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:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:17:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:17:21,857 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:17:21,857 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:17:21,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:21 BoogieIcfgContainer [2019-01-14 02:17:21,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:17:21,859 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:17:21,859 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:17:21,863 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:17:21,864 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:21,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:17:21" (1/3) ... [2019-01-14 02:17:21,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61dea9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:21, skipping insertion in model container [2019-01-14 02:17:21,865 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:21,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:21" (2/3) ... [2019-01-14 02:17:21,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61dea9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:21, skipping insertion in model container [2019-01-14 02:17:21,866 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:21,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:21" (3/3) ... [2019-01-14 02:17:21,868 INFO L375 chiAutomizerObserver]: Analyzing ICFG UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 02:17:21,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:17:21,963 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:17:21,963 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:17:21,963 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:17:21,963 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:17:21,963 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:17:21,963 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:17:21,964 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:17:21,965 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:17:21,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:17:22,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:17:22,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:22,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:22,019 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:22,020 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:22,020 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:17:22,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:17:22,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:17:22,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:22,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:22,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:17:22,023 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:22,032 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 10#L27-2true [2019-01-14 02:17:22,033 INFO L796 eck$LassoCheckResult]: Loop: 10#L27-2true assume !!(0 != main_~x~0 && main_~y~0 > 0); 7#L19true assume !(main_~x~0 > 0); 5#L27true assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 10#L27-2true [2019-01-14 02:17:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:17:22,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:22,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash 40076, now seen corresponding path program 1 times [2019-01-14 02:17:22,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963597, now seen corresponding path program 1 times [2019-01-14 02:17:22,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:22,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:22,313 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:22,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:22,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:22,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:22,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:22,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:22,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:22,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:22,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:22,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:22,316 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:22,341 INFO 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:22,390 INFO 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:22,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:22,461 INFO 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:22,479 INFO 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:22,664 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 02:17:22,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:22,909 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:22,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:22,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:22,941 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:22,941 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:22,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:22,949 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:22,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:22,973 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:22,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:22,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:23,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:23,001 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:23,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:23,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:23,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:23,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:23,034 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:23,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:23,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:23,106 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:23,109 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:23,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:23,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:23,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:23,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:23,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:23,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:23,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:23,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:17:23,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:23,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:23,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:23,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:23,125 INFO 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:23,131 INFO 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:23,148 INFO 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:23,374 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 02:17:23,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:23,436 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:23,439 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:23,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:23,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:23,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:23,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:23,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:23,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:23,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:23,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:23,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:23,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:23,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:23,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:23,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:23,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:23,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:23,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:23,463 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:23,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:23,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:23,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:23,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:23,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:23,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:23,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:23,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:17:23,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:23,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:23,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:23,480 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:17:23,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:23,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:17:23,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:23,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:23,489 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:23,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:23,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:23,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:23,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:23,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:23,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:23,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:23,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:23,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:23,506 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:23,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:23,509 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:23,509 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:23,510 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:23,511 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:23,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:23,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:23,795 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:23,813 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:23,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-14 02:17:23,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 33 states and 49 transitions. Complement of second has 8 states. [2019-01-14 02:17:23,998 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:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-14 02:17:24,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:17:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:24,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:17:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:24,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:17:24,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:24,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 49 transitions. [2019-01-14 02:17:24,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:17:24,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 16 states and 25 transitions. [2019-01-14 02:17:24,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:17:24,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:17:24,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2019-01-14 02:17:24,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:24,017 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2019-01-14 02:17:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2019-01-14 02:17:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 02:17:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:17:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2019-01-14 02:17:24,042 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-14 02:17:24,043 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-14 02:17:24,043 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:17:24,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2019-01-14 02:17:24,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:17:24,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:24,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:24,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:17:24,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:24,045 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 83#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 94#L19 [2019-01-14 02:17:24,045 INFO L796 eck$LassoCheckResult]: Loop: 94#L19 assume main_~x~0 > 0; 95#L20 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 96#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 94#L19 [2019-01-14 02:17:24,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:17:24,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:24,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 42852, now seen corresponding path program 1 times [2019-01-14 02:17:24,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:24,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 29863643, now seen corresponding path program 1 times [2019-01-14 02:17:24,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:24,151 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:24,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:24,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:24,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:24,152 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:24,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:24,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:24,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:24,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:24,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:24,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:24,154 INFO 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:24,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:24,171 INFO 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:24,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:24,273 INFO 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:24,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:24,715 INFO L412 LassoAnalysis]: Checking for nontermination... 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:24,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:24,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:24,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:24,744 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 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:24,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:24,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:24,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:24,774 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 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:24,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:24,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:24,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:24,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:24,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:24,807 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:24,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:24,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:24,892 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:24,894 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:24,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:24,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:24,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:24,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:24,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:24,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:24,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:24,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:17:24,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:24,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:24,898 INFO 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:24,901 INFO 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:24,919 INFO 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:24,927 INFO 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:24,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:25,051 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:25,052 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:25,052 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:25,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:25,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:25,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:25,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:25,065 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:25,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:25,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:25,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:25,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:25,077 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:25,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:25,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:25,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:25,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:25,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:25,084 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:25,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:25,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:25,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:25,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:25,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:25,098 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:25,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:25,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:25,100 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:25,100 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:25,100 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:25,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:25,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:25,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:25,176 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:25,176 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:25,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:17:25,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 42 states and 70 transitions. Complement of second has 7 states. [2019-01-14 02:17:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:17:25,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:17:25,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:25,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:17:25,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:25,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:17:25,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:25,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 70 transitions. [2019-01-14 02:17:25,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:17:25,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 56 transitions. [2019-01-14 02:17:25,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:17:25,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:17:25,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 56 transitions. [2019-01-14 02:17:25,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:25,248 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2019-01-14 02:17:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 56 transitions. [2019-01-14 02:17:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-01-14 02:17:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 02:17:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 52 transitions. [2019-01-14 02:17:25,254 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. [2019-01-14 02:17:25,254 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. [2019-01-14 02:17:25,254 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:17:25,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 52 transitions. [2019-01-14 02:17:25,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:17:25,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:25,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:25,256 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:17:25,256 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:25,257 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 179#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 189#L19 assume main_~x~0 > 0; 185#L20 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; 192#L27-2 [2019-01-14 02:17:25,257 INFO L796 eck$LassoCheckResult]: Loop: 192#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 209#L19 assume !(main_~x~0 > 0); 208#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 192#L27-2 [2019-01-14 02:17:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2019-01-14 02:17:25,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:25,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 40076, now seen corresponding path program 2 times [2019-01-14 02:17:25,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:25,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:25,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869056, now seen corresponding path program 1 times [2019-01-14 02:17:25,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:25,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:17:25,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:17:25,405 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:25,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:25,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:25,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:25,406 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:25,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:25,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:25,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:25,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:25,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:25,408 INFO 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:25,415 INFO 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:25,419 INFO 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:25,458 INFO 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:25,477 INFO 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:25,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:25,652 INFO L412 LassoAnalysis]: Checking for nontermination... 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:25,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:25,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:25,677 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:25,677 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:25,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:25,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:25,687 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:25,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:25,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:25,734 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:25,740 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:25,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:25,789 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:25,791 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:25,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:25,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:25,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:25,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:25,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:25,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:25,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:25,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:17:25,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:25,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:25,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:25,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:25,810 INFO 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:25,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:25,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:25,988 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:25,988 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:25,989 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:25,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:25,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:25,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:25,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:25,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:25,994 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:25,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:25,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:25,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:25,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:17:25,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:25,996 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:17:25,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:25,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:26,000 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:26,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:26,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:26,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:26,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:26,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:26,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:26,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:26,007 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:26,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:26,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:26,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:26,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:26,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:26,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:26,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:26,012 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:26,015 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:26,015 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:26,015 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:26,016 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:26,016 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:26,016 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:26,016 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:26,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:26,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:26,075 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:26,076 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:26,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 52 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-01-14 02:17:26,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 52 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 43 states and 69 transitions. Complement of second has 7 states. [2019-01-14 02:17:26,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:17:26,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:17:26,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:17:26,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:17:26,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2019-01-14 02:17:26,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 02:17:26,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 69 transitions. [2019-01-14 02:17:26,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:17:26,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:17:26,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 69 transitions. [2019-01-14 02:17:26,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:26,133 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. [2019-01-14 02:17:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 69 transitions. [2019-01-14 02:17:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-14 02:17:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 02:17:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2019-01-14 02:17:26,140 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 67 transitions. [2019-01-14 02:17:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:17:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:17:26,144 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 4 states. [2019-01-14 02:17:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:17:26,184 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2019-01-14 02:17:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:17:26,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-01-14 02:17:26,189 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 02:17:26,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 53 transitions. [2019-01-14 02:17:26,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:17:26,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:17:26,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 53 transitions. [2019-01-14 02:17:26,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:26,191 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-01-14 02:17:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 53 transitions. [2019-01-14 02:17:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-14 02:17:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:17:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2019-01-14 02:17:26,197 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-01-14 02:17:26,197 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-01-14 02:17:26,197 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:17:26,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2019-01-14 02:17:26,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:26,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:26,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:26,198 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:17:26,199 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:26,199 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 385#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 410#L19 assume main_~x~0 > 0; 395#L20 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; 393#L27-2 [2019-01-14 02:17:26,199 INFO L796 eck$LassoCheckResult]: Loop: 393#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 390#L19 assume main_~x~0 > 0; 391#L20 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; 393#L27-2 [2019-01-14 02:17:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 2 times [2019-01-14 02:17:26,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash 39820, now seen corresponding path program 1 times [2019-01-14 02:17:26,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869312, now seen corresponding path program 3 times [2019-01-14 02:17:26,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,318 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:26,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:26,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:26,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:26,318 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:26,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:26,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:26,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:17:26,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:26,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:26,321 INFO 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:26,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:26,334 INFO 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:26,345 INFO 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:26,350 INFO 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:26,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:26,408 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:26,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:26,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:26,435 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:26,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:26,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:26,444 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet3=5} Honda state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet3=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:26,466 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:26,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:26,518 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:26,520 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:26,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:26,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:26,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:26,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:26,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:26,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:26,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:26,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:17:26,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:26,522 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:26,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:26,538 INFO 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:26,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:26,547 INFO 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:26,550 INFO 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:26,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:26,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:26,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:26,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:26,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:26,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:26,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:26,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:26,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:26,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:26,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:26,654 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:26,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:26,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:26,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:26,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:26,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:26,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:26,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:26,681 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:26,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:26,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:26,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:26,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:26,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:26,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:26,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:26,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:26,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:26,709 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:26,710 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:26,712 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:26,712 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:26,712 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:26,713 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:26,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:26,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:26,851 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:26,852 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:26,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-01-14 02:17:26,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 35 states and 52 transitions. Complement of second has 6 states. [2019-01-14 02:17:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:17:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:17:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:17:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:17:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:26,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 52 transitions. [2019-01-14 02:17:26,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:26,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 52 transitions. [2019-01-14 02:17:26,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:17:26,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:17:26,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2019-01-14 02:17:26,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:26,889 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-01-14 02:17:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2019-01-14 02:17:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-14 02:17:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:17:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-01-14 02:17:26,893 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-01-14 02:17:26,893 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-01-14 02:17:26,893 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:17:26,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 50 transitions. [2019-01-14 02:17:26,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:26,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:26,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:26,895 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:17:26,895 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:26,895 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 492#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 518#L19 assume main_~x~0 > 0; 498#L20 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; 521#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 502#L19 [2019-01-14 02:17:26,895 INFO L796 eck$LassoCheckResult]: Loop: 502#L19 assume main_~x~0 > 0; 504#L20 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 501#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 502#L19 [2019-01-14 02:17:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 29863581, now seen corresponding path program 4 times [2019-01-14 02:17:26,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash 42852, now seen corresponding path program 2 times [2019-01-14 02:17:26,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash 607724360, now seen corresponding path program 1 times [2019-01-14 02:17:26,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:26,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,029 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:27,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:27,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:27,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:27,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:27,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:27,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:27,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:17:27,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:27,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:27,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:27,039 INFO 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:27,047 INFO 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:27,053 INFO 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:27,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:27,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:27,143 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:27,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:27,156 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,179 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:27,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:27,264 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:27,265 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:27,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:27,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:27,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:27,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:27,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:27,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:27,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:17:27,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:27,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:27,268 INFO 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:27,271 INFO 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:27,279 INFO 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:27,281 INFO 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:27,284 INFO 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:27,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:27,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:27,339 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:27,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:27,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:27,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:27,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:27,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:27,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:27,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:27,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:27,350 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:27,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:27,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:27,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:27,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:27,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:27,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:27,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:27,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:27,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:27,362 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:27,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:27,363 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:27,363 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:27,363 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:27,364 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,422 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:27,422 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:27,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-14 02:17:27,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 57 states and 89 transitions. Complement of second has 7 states. [2019-01-14 02:17:27,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:17:27,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:17:27,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:27,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,540 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:27,540 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:27,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-14 02:17:27,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 57 states and 89 transitions. Complement of second has 7 states. [2019-01-14 02:17:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:17:27,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:17:27,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:27,584 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:27,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:27,621 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:27,622 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:27,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-14 02:17:27,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 59 states and 92 transitions. Complement of second has 8 states. [2019-01-14 02:17:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:17:27,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:17:27,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:27,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:17:27,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:27,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:17:27,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:27,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 92 transitions. [2019-01-14 02:17:27,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:27,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 17 states and 21 transitions. [2019-01-14 02:17:27,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:17:27,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:17:27,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-01-14 02:17:27,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:27,688 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:17:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-01-14 02:17:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-14 02:17:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:17:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 02:17:27,694 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:17:27,694 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:17:27,694 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:17:27,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-14 02:17:27,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:27,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:27,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:27,696 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-14 02:17:27,696 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:27,696 INFO L794 eck$LassoCheckResult]: Stem: 812#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0;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; 813#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 818#L19 assume !(main_~x~0 > 0); 819#L27 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~y~0 := main_~y~0 - 1;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 825#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 823#L19 assume !(main_~x~0 > 0); 814#L27 [2019-01-14 02:17:27,696 INFO L796 eck$LassoCheckResult]: Loop: 814#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~x~0 := 1 + main_~x~0; 815#L27-2 assume !!(0 != main_~x~0 && main_~y~0 > 0); 824#L19 assume !(main_~x~0 > 0); 814#L27 [2019-01-14 02:17:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash 926018970, now seen corresponding path program 1 times [2019-01-14 02:17:27,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:27,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:27,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:27,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 53186, now seen corresponding path program 3 times [2019-01-14 02:17:27,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:27,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash 456216457, now seen corresponding path program 1 times [2019-01-14 02:17:27,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:27,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:27,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:27,834 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:27,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:27,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:27,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:27,835 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:27,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:27,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:27,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:17:27,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:27,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:27,844 INFO 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:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:27,850 INFO 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:27,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:27,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:27,916 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:27,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:27,925 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:27,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:27,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:27,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:27,994 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:27,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:27,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:28,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:28,019 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:28,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:28,023 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:28,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:28,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:28,114 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:28,116 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:28,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:28,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:28,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:28,117 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:28,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:28,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:28,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:28,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:17:28,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:28,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:28,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:28,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:28,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:28,196 INFO 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:28,203 INFO 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:28,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:28,275 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:28,275 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:28,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:28,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:28,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:28,277 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:17:28,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:28,277 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:17:28,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:28,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:28,280 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:28,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:28,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:28,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:28,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:28,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:28,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:28,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:28,286 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:28,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:28,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:28,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:28,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:28,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:28,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:28,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:28,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:28,288 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:28,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:28,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:28,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:28,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:28,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:28,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:28,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:28,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:28,294 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:28,295 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:28,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:28,295 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:17:28,295 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:28,296 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:28,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:17:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,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:28,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:28,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:17:28,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 26 transitions. Complement of second has 5 states. [2019-01-14 02:17:28,374 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:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:17:28,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:17:28,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:28,375 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:28,428 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:28,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:17:28,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 26 transitions. Complement of second has 5 states. [2019-01-14 02:17:28,448 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:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:17:28,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:17:28,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:28,449 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:28,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:28,482 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:28,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:17:28,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 4 states. [2019-01-14 02:17:28,508 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:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:17:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:17:28,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:28,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:17:28,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:28,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:17:28,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:28,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-14 02:17:28,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:28,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-14 02:17:28,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:28,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:28,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:28,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:28,513 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:28,513 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:28,513 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:28,513 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:17:28,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:17:28,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:28,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:17:28,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:17:28 BoogieIcfgContainer [2019-01-14 02:17:28,523 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:17:28,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:17:28,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:17:28,524 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:17:28,524 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:21" (3/4) ... [2019-01-14 02:17:28,529 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:17:28,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:17:28,530 INFO L168 Benchmark]: Toolchain (without parser) took 7250.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -65.6 MB). Peak memory consumption was 134.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:28,531 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:28,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 933.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:28,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:28,533 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:28,535 INFO L168 Benchmark]: RCFGBuilder took 286.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:28,535 INFO L168 Benchmark]: BuchiAutomizer took 6664.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:28,536 INFO L168 Benchmark]: Witness Printer took 5.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:28,544 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 933.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 286.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6664.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 73 SDslu, 32 SDs, 0 SdLazy, 117 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf98 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp84 dnf100 smp100 tf112 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...