./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0bce2603970e0a002a5b33cfd00ef3446011286 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:34:14,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:14,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:14,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:14,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:14,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:14,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:14,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:14,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:14,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:14,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:14,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:14,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:14,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:14,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:14,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:14,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:14,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:14,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:14,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:14,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:14,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:14,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:14,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:14,734 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:14,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:14,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:14,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:14,738 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:14,739 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:14,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:14,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:14,741 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:14,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:14,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:14,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:14,743 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:34:14,761 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:14,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:14,763 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:14,763 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:14,763 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:14,763 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:14,764 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:14,764 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:14,764 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:14,764 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:14,765 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:14,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:14,765 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:14,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:14,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:14,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:14,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:14,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:14,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:14,766 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:14,767 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:14,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:14,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:14,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:14,767 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:14,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:14,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:14,768 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:14,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:14,769 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 -> c0bce2603970e0a002a5b33cfd00ef3446011286 [2019-01-01 21:34:14,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:14,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:14,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:14,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:14,869 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:14,870 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:34:14,943 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a82861b/547c916445804372b611a55fee91d3b8/FLAG5321645eb [2019-01-01 21:34:15,375 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:15,376 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:34:15,383 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a82861b/547c916445804372b611a55fee91d3b8/FLAG5321645eb [2019-01-01 21:34:15,753 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a82861b/547c916445804372b611a55fee91d3b8 [2019-01-01 21:34:15,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:15,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:15,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:15,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:15,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:15,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:15" (1/1) ... [2019-01-01 21:34:15,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778b065d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:15, skipping insertion in model container [2019-01-01 21:34:15,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:15" (1/1) ... [2019-01-01 21:34:15,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:15,803 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:16,078 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:16,086 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:16,112 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:16,137 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:16,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16 WrapperNode [2019-01-01 21:34:16,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:16,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:16,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:16,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:16,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:16,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:16,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:16,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:16,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... [2019-01-01 21:34:16,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:16,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:16,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:16,226 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:16,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:16,765 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:16,766 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-01 21:34:16,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:16 BoogieIcfgContainer [2019-01-01 21:34:16,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:16,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:16,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:16,772 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:16,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:16,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:15" (1/3) ... [2019-01-01 21:34:16,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b719829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:16, skipping insertion in model container [2019-01-01 21:34:16,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:16,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:16" (2/3) ... [2019-01-01 21:34:16,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b719829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:16, skipping insertion in model container [2019-01-01 21:34:16,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:16,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:16" (3/3) ... [2019-01-01 21:34:16,778 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:34:16,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:16,871 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:16,871 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:16,871 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:16,872 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:16,872 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:16,872 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:16,873 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:16,873 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:16,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:34:16,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 21:34:16,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:16,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:16,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:34:16,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:16,931 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:16,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:34:16,933 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 21:34:16,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:16,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:16,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:34:16,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:16,944 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5; 10#L41true assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 6#L18true assume !(f_~k~0 > 1073741823); 13#L23-1true [2019-01-01 21:34:16,945 INFO L796 eck$LassoCheckResult]: Loop: 13#L23-1true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 13#L23-1true [2019-01-01 21:34:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-01-01 21:34:16,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2019-01-01 21:34:17,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:17,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 957453, now seen corresponding path program 1 times [2019-01-01 21:34:17,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:17,277 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:17,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:17,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:17,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:17,279 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:17,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:17,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:17,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:17,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:34:17,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:17,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:17,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,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-01 21:34:17,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:17,890 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:17,891 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:17,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:17,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:17,916 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:17,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:17,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:17,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:17,960 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:17,960 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:17,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:17,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:17,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:17,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:18,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:18,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:18,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:18,024 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:18,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:18,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:18,058 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:18,059 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:18,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:18,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:18,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:18,086 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:18,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:18,111 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:18,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:18,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:30,261 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:34:30,269 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:30,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:30,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:30,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:30,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:30,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:30,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:30,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:30,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:34:30,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:30,272 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:30,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,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-01 21:34:30,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:30,747 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:34:30,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:30,955 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:30,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:30,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:30,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:30,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:30,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:30,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:30,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:30,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:30,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:30,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:30,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:30,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:30,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:30,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:30,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:30,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:30,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:30,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:30,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:30,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:30,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:30,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:30,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:30,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:30,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:30,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:30,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:30,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:30,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:30,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:31,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:31,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:31,090 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:31,159 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 21:34:31,159 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:34:31,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:31,165 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:31,165 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:31,166 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-01 21:34:31,208 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:31,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:31,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:31,518 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:34:31,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 21:34:31,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 49 states and 76 transitions. Complement of second has 7 states. [2019-01-01 21:34:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2019-01-01 21:34:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:34:31,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:31,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:34:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:31,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:31,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 76 transitions. [2019-01-01 21:34:31,921 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-01-01 21:34:31,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 20 states and 28 transitions. [2019-01-01 21:34:31,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:34:31,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:34:31,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-01-01 21:34:31,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:31,928 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-01 21:34:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-01-01 21:34:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-01-01 21:34:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:34:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-01-01 21:34:31,960 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:34:31,960 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:34:31,961 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:31,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-01-01 21:34:31,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 21:34:31,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:31,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:31,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:34:31,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:31,963 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 115#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 120#L18-1 assume !(f_~k~0 > 1073741823); 121#L23-3 [2019-01-01 21:34:31,963 INFO L796 eck$LassoCheckResult]: Loop: 121#L23-3 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 121#L23-3 [2019-01-01 21:34:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash 32101, now seen corresponding path program 1 times [2019-01-01 21:34:31,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times [2019-01-01 21:34:31,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash 995187, now seen corresponding path program 1 times [2019-01-01 21:34:31,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:31,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:32,290 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:34:32,394 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:34:32,406 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:32,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:32,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:32,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:32,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:32,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:32,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:32,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-01 21:34:32,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:32,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:32,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,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-01 21:34:32,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:32,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:32,718 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,728 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,728 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#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-01 21:34:32,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,753 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,753 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,779 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,808 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,808 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,838 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~d=0, ULTIMATE.start_f_#in~d=0} Honda state: {ULTIMATE.start_f_~d=2, ULTIMATE.start_f_#in~d=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,862 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,862 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_~y~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,949 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:32,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:32,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:32,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} 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-01 21:34:32,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:32,995 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:33,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:33,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:45,117 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:34:45,127 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:45,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:45,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:45,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:45,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:45,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:45,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:45,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-01 21:34:45,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:45,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:45,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-01 21:34:45,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:45,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:45,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:45,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:45,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:45,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:45,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:45,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:45,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:45,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:45,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:45,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:45,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:45,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:45,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:45,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:45,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:45,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:45,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:45,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:45,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:45,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:45,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:45,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:45,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:45,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:45,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:45,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:45,442 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:45,443 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:45,443 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:45,447 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:45,448 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:45,448 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-01 21:34:45,473 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:45,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:45,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:45,693 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:34:45,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:34:45,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:34:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:34:45,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:34:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:34:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:45,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:45,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-01 21:34:45,785 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-01 21:34:45,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2019-01-01 21:34:45,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:34:45,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:34:45,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-01-01 21:34:45,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:45,788 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:34:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-01-01 21:34:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2019-01-01 21:34:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:34:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-01 21:34:45,791 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-01 21:34:45,791 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-01 21:34:45,791 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:45,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2019-01-01 21:34:45,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:45,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:45,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:45,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:34:45,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:45,796 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 195#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 202#L18 assume !(f_~k~0 > 1073741823); 198#L23-1 assume !(f_~z~0 < f_~k~0); 196#L29-2 [2019-01-01 21:34:45,796 INFO L796 eck$LassoCheckResult]: Loop: 196#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 197#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 196#L29-2 [2019-01-01 21:34:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 957451, now seen corresponding path program 1 times [2019-01-01 21:34:45,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 1 times [2019-01-01 21:34:45,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash 920111346, now seen corresponding path program 1 times [2019-01-01 21:34:45,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,910 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:45,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:45,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:45,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:45,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:45,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:45,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:45,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:34:45,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:45,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:45,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,094 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,094 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,103 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,195 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,196 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=-13, ULTIMATE.start_f_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,248 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=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-01 21:34:46,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,275 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} 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) [2019-01-01 21:34:46,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,298 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:46,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,421 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:46,424 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:46,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:46,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:46,424 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:46,424 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:46,424 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,424 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:46,424 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:46,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:34:46,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:46,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:46,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:46,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:46,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:46,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:46,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:46,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:46,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:46,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:46,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:46,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:46,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:46,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:46,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:46,757 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:46,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:46,760 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:46,760 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:46,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 21:34:46,782 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:46,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:46,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:34:47,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2019-01-01 21:34:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:34:47,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:47,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:34:47,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:34:47,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2019-01-01 21:34:47,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:47,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 28 transitions. [2019-01-01 21:34:47,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:34:47,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:34:47,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-01-01 21:34:47,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:47,022 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-01 21:34:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-01-01 21:34:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-01 21:34:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:34:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-01-01 21:34:47,025 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-01 21:34:47,026 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-01 21:34:47,027 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:47,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-01-01 21:34:47,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:47,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:47,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:47,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:34:47,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:47,029 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 279#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 288#L18-1 assume !(f_~k~0 > 1073741823); 289#L23-3 assume !(f_~z~0 < f_~k~0); 277#L29-5 [2019-01-01 21:34:47,030 INFO L796 eck$LassoCheckResult]: Loop: 277#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 275#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 277#L29-5 [2019-01-01 21:34:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 995185, now seen corresponding path program 1 times [2019-01-01 21:34:47,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 1 times [2019-01-01 21:34:47,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 956374936, now seen corresponding path program 1 times [2019-01-01 21:34:47,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,190 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:47,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:47,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:47,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:47,191 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:47,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:47,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:47,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:34:47,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:47,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:47,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,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-01 21:34:47,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:47,409 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:47,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:47,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:47,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:47,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:47,516 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-13} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:47,543 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:47,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,663 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:47,664 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:47,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:47,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:47,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:47,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:47,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:47,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:47,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:34:47,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:47,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:47,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,820 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:47,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:47,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:47,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:47,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:47,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:47,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:47,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:47,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:47,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:47,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:47,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:47,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:47,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:47,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:47,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:47,890 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:47,890 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:47,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:47,896 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:47,896 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:47,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 21:34:47,918 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:48,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 21:34:48,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:34:48,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:34:48,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:48,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:34:48,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:34:48,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-01 21:34:48,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:48,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 34 transitions. [2019-01-01 21:34:48,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:34:48,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:34:48,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2019-01-01 21:34:48,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:48,102 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-01-01 21:34:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2019-01-01 21:34:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 21:34:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:34:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2019-01-01 21:34:48,106 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-01 21:34:48,106 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-01 21:34:48,109 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:34:48,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2019-01-01 21:34:48,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:34:48,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:48,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:48,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:34:48,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:48,111 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 372#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 383#L18 assume !(f_~k~0 > 1073741823); 378#L23-1 assume !(f_~z~0 < f_~k~0); 379#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 377#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 385#L30 [2019-01-01 21:34:48,111 INFO L796 eck$LassoCheckResult]: Loop: 385#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 373#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 374#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 385#L30 [2019-01-01 21:34:48,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash 920111342, now seen corresponding path program 1 times [2019-01-01 21:34:48,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 63396, now seen corresponding path program 1 times [2019-01-01 21:34:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 555740055, now seen corresponding path program 1 times [2019-01-01 21:34:48,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,180 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,180 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:48,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:34:48,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,266 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,271 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:48,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,335 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,335 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,362 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,410 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 21:34:48,856 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-01 21:34:48,878 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,879 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:48,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-01 21:34:48,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,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-01 21:34:48,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:49,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:49,063 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:49,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:49,069 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0, ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:49,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:49,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:49,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:49,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:49,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:49,122 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:49,144 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:49,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:49,344 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:49,345 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:49,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:49,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:49,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:49,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:49,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:49,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:49,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-01 21:34:49,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:49,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:49,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,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-01 21:34:49,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:49,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:49,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:49,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:49,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:49,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:49,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:49,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:49,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:49,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:49,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:49,525 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:49,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:49,526 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:49,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:49,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:49,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:49,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:49,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:49,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:49,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:49,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:49,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:49,553 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:49,560 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:49,561 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:49,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:49,562 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:49,562 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:49,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 21:34:49,594 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:49,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:34:49,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 21:34:49,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 32 states and 46 transitions. Complement of second has 7 states. [2019-01-01 21:34:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:34:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:34:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:34:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 21:34:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 21:34:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 46 transitions. [2019-01-01 21:34:49,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:34:49,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 41 transitions. [2019-01-01 21:34:49,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:34:49,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:34:49,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2019-01-01 21:34:49,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:49,905 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-01-01 21:34:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2019-01-01 21:34:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-01 21:34:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:34:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-01-01 21:34:49,910 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-01-01 21:34:49,910 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-01-01 21:34:49,910 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:34:49,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2019-01-01 21:34:49,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:34:49,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:49,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:49,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:34:49,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:49,913 INFO L794 eck$LassoCheckResult]: Stem: 487#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 488#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 496#L18-1 assume !(f_~k~0 > 1073741823); 497#L23-3 assume !(f_~z~0 < f_~k~0); 505#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 483#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 484#L30-1 [2019-01-01 21:34:49,913 INFO L796 eck$LassoCheckResult]: Loop: 484#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 501#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 502#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 484#L30-1 [2019-01-01 21:34:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 956374932, now seen corresponding path program 1 times [2019-01-01 21:34:49,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 101130, now seen corresponding path program 1 times [2019-01-01 21:34:49,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371113, now seen corresponding path program 1 times [2019-01-01 21:34:49,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:49,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:49,995 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:49,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:49,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:49,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:49,995 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:49,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:49,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:49,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:49,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:34:49,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:49,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:49,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,162 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 21:34:50,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:50,211 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:50,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:50,219 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,241 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:50,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:50,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:50,301 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:50,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:50,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:50,369 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:50,369 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 21:34:50,730 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-01 21:34:50,743 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:50,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:50,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:50,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:50,745 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:50,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:50,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:50,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-01 21:34:50,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:50,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:50,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:50,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:50,924 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,932 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:50,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:50,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:50,973 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-2} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0}, {ULTIMATE.start_f_~z~0=-8, ULTIMATE.start_f_~k~0=6}, {ULTIMATE.start_f_~z~0=7, ULTIMATE.start_f_~k~0=-6}] Lambdas: [15, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:50,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:50,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0, ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_~y~0=4, ULTIMATE.start_f_#t~nondet4=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:51,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,043 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,060 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,087 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,139 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:51,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,161 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,166 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:51,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:51,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:51,212 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:51,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:51,400 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:51,402 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:51,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:51,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:51,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:51,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:51,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:51,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:51,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:51,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-01 21:34:51,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:51,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:51,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:51,578 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:51,579 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:51,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:51,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:51,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:51,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:51,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:51,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:51,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:51,608 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:51,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:51,617 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:51,617 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:51,621 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:51,622 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:51,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 21:34:51,655 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:51,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:51,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:51,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:34:51,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-01-01 21:34:51,998 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 37 states and 53 transitions. Complement of second has 7 states. [2019-01-01 21:34:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:34:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:34:51,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:34:51,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:51,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 21:34:52,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:52,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 21:34:52,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:52,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 53 transitions. [2019-01-01 21:34:52,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:52,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 48 transitions. [2019-01-01 21:34:52,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:34:52,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:34:52,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2019-01-01 21:34:52,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:52,003 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-01-01 21:34:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2019-01-01 21:34:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-01 21:34:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 21:34:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-01-01 21:34:52,006 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-01-01 21:34:52,006 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-01-01 21:34:52,006 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:34:52,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2019-01-01 21:34:52,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:52,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:52,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:52,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:34:52,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:52,008 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 615#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 625#L18 assume !(f_~k~0 > 1073741823); 620#L23-1 assume !(f_~z~0 < f_~k~0); 621#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 636#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 631#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 632#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 638#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 616#L29-2 [2019-01-01 21:34:52,008 INFO L796 eck$LassoCheckResult]: Loop: 616#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 617#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 616#L29-2 [2019-01-01 21:34:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 555740059, now seen corresponding path program 1 times [2019-01-01 21:34:52,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:52,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:52,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:52,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 2 times [2019-01-01 21:34:52,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1490252930, now seen corresponding path program 2 times [2019-01-01 21:34:52,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:52,283 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-01 21:34:52,431 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:34:52,436 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:52,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:52,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:52,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:52,436 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:52,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:52,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:52,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:52,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-01 21:34:52,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:52,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:52,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,568 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:52,568 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:52,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:52,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:52,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:52,593 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:52,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:52,598 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:52,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:52,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:52,702 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:52,704 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:52,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:52,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:52,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:52,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:52,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:52,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:52,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:52,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-01 21:34:52,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:52,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:52,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:52,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:52,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:52,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:52,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:52,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:52,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:52,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:52,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:52,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:52,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:52,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:52,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:52,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:52,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:52,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:52,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:52,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:52,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:52,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:52,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:52,879 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:34:52,879 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:34:52,879 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:52,880 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:52,881 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:52,881 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 21:34:52,906 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:53,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:53,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:53,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:53,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-01-01 21:34:53,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 50 states and 69 transitions. Complement of second has 6 states. [2019-01-01 21:34:53,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:34:53,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:34:53,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:53,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:53,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:53,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:34:53,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:53,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. [2019-01-01 21:34:53,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:53,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 59 transitions. [2019-01-01 21:34:53,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:34:53,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:34:53,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2019-01-01 21:34:53,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:53,136 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-01-01 21:34:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2019-01-01 21:34:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-01 21:34:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:34:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2019-01-01 21:34:53,141 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2019-01-01 21:34:53,141 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2019-01-01 21:34:53,141 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:34:53,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2019-01-01 21:34:53,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:53,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:53,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:53,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:34:53,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:53,146 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 761#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 769#L18-1 assume !(f_~k~0 > 1073741823); 770#L23-3 assume !(f_~z~0 < f_~k~0); 784#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 786#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 776#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 777#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 787#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 757#L29-5 [2019-01-01 21:34:53,146 INFO L796 eck$LassoCheckResult]: Loop: 757#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 756#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 757#L29-5 [2019-01-01 21:34:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371109, now seen corresponding path program 1 times [2019-01-01 21:34:53,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:53,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 2 times [2019-01-01 21:34:53,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash 645770306, now seen corresponding path program 2 times [2019-01-01 21:34:53,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:53,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,339 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:53,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:53,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:53,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:53,340 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:53,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:53,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:53,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Lasso [2019-01-01 21:34:53,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:53,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:53,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:53,464 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:53,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:53,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:53,473 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:53,495 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:53,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:53,609 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:53,610 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:53,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:53,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:53,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:53,611 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:53,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:53,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:53,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Lasso [2019-01-01 21:34:53,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:53,612 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:53,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:53,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:53,783 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:53,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:53,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:53,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:53,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:53,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:53,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:53,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:53,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:53,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:53,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:53,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:53,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:53,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:53,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:53,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:53,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:53,797 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:53,800 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:53,801 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:53,801 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:53,803 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:53,803 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:53,803 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 21:34:53,830 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:54,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27 Second operand 4 states. [2019-01-01 21:34:54,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 58 states and 79 transitions. Complement of second has 6 states. [2019-01-01 21:34:54,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:34:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:34:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:34:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:54,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 79 transitions. [2019-01-01 21:34:54,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:54,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 50 states and 69 transitions. [2019-01-01 21:34:54,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 21:34:54,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:34:54,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 69 transitions. [2019-01-01 21:34:54,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:54,297 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2019-01-01 21:34:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 69 transitions. [2019-01-01 21:34:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-01 21:34:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 21:34:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-01-01 21:34:54,307 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-01-01 21:34:54,307 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-01-01 21:34:54,307 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:34:54,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. [2019-01-01 21:34:54,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:34:54,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,309 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:34:54,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:54,309 INFO L794 eck$LassoCheckResult]: Stem: 923#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 924#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 934#L18 assume !(f_~k~0 > 1073741823); 930#L23-1 assume !(f_~z~0 < f_~k~0); 925#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 926#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 958#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 951#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 952#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 956#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 955#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 936#L29-2 [2019-01-01 21:34:54,309 INFO L796 eck$LassoCheckResult]: Loop: 936#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 935#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 936#L29-2 [2019-01-01 21:34:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1600239380, now seen corresponding path program 3 times [2019-01-01 21:34:54,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 3 times [2019-01-01 21:34:54,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 231753147, now seen corresponding path program 4 times [2019-01-01 21:34:54,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,543 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:54,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:54,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:54,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:54,544 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:54,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:54,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:54,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Lasso [2019-01-01 21:34:54,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:54,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:54,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-01 21:34:54,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:54,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:54,672 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,677 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,680 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,705 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,731 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,780 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,807 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,807 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,859 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,859 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:54,883 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:54,883 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:54,904 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:54,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:54,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:55,017 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:55,018 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:55,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:55,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:55,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:55,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:55,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:55,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:55,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:55,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Lasso [2019-01-01 21:34:55,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:55,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:55,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:55,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:55,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:55,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:55,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:55,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:55,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:55,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:55,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:55,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:55,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:55,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:55,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:55,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:55,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:55,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:55,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:55,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:55,236 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:55,253 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:55,253 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:55,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:55,258 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:55,258 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:55,258 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 21:34:55,324 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:55,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:55,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:56,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 21:34:56,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2019-01-01 21:34:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:34:56,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:56,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,379 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:56,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 21:34:56,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2019-01-01 21:34:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:34:56,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:56,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,472 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,549 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:56,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 21:34:56,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 59 states and 80 transitions. Complement of second has 5 states. [2019-01-01 21:34:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-01 21:34:56,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:56,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:34:56,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 21:34:56,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:56,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 80 transitions. [2019-01-01 21:34:56,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:56,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 25 states and 34 transitions. [2019-01-01 21:34:56,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:34:56,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:34:56,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-01 21:34:56,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:56,638 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-01 21:34:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-01 21:34:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-01 21:34:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 21:34:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-01 21:34:56,643 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-01 21:34:56,643 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-01 21:34:56,643 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:34:56,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-01-01 21:34:56,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:56,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:56,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:56,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:34:56,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:56,648 INFO L794 eck$LassoCheckResult]: Stem: 1310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 1311#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1312#L18-1 assume !(f_~k~0 > 1073741823); 1313#L23-3 assume !(f_~z~0 < f_~k~0); 1316#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1317#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1329#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1328#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 1326#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1325#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1321#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1323#L29-5 [2019-01-01 21:34:56,649 INFO L796 eck$LassoCheckResult]: Loop: 1323#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1324#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1323#L29-5 [2019-01-01 21:34:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash 755756756, now seen corresponding path program 3 times [2019-01-01 21:34:56,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 3 times [2019-01-01 21:34:56,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 432771643, now seen corresponding path program 4 times [2019-01-01 21:34:56,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,867 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-01 21:34:56,894 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:56,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:56,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:56,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:56,894 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:56,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:56,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:56,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:56,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Lasso [2019-01-01 21:34:56,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:56,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:56,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,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-01 21:34:56,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:56,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:57,064 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,152 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,158 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:57,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,182 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:57,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,304 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:57,305 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:57,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:57,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:57,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:57,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:57,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:57,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:57,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Lasso [2019-01-01 21:34:57,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:57,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:57,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,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-01 21:34:57,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-01 21:34:57,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:57,461 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:57,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:57,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:57,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:57,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:57,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:57,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:57,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:57,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:57,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:57,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:57,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:57,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:57,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:57,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:57,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:57,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:57,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:57,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:57,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:57,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:57,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:57,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:57,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:57,511 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:57,512 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:57,513 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:34:57,513 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:57,513 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 21:34:57,556 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:34:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:57,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:57,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:57,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:57,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 21:34:57,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2019-01-01 21:34:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:34:57,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:57,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:57,951 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:57,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:58,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:58,024 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 21:34:58,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2019-01-01 21:34:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:34:58,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:58,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,054 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:58,103 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:34:58,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 21:34:58,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 36 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:34:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:34:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:34:58,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:34:58,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:34:58,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 21:34:58,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-01-01 21:34:58,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:58,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-01-01 21:34:58,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:58,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:58,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:58,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:58,144 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:58,145 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:58,145 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:58,145 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:34:58,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:34:58,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:58,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:34:58,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:34:58 BoogieIcfgContainer [2019-01-01 21:34:58,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:34:58,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:34:58,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:34:58,157 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:34:58,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:16" (3/4) ... [2019-01-01 21:34:58,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:34:58,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:34:58,165 INFO L168 Benchmark]: Toolchain (without parser) took 42406.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -204.9 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:58,166 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:58,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:58,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:58,167 INFO L168 Benchmark]: Boogie Preprocessor took 34.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:58,167 INFO L168 Benchmark]: RCFGBuilder took 540.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:58,169 INFO L168 Benchmark]: BuchiAutomizer took 41387.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.9 MB). Peak memory consumption was 122.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:58,170 INFO L168 Benchmark]: Witness Printer took 6.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:58,178 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 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 51.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 540.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41387.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.9 MB). Peak memory consumption was 122.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 10 terminating modules (0 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * z + k and consists of 5 locations. One deterministic module has affine ranking function -1 * z + k and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function x + -1 * d 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 y 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 y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 36.6s. Construction of modules took 0.4s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 8. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 182 SDtfs, 246 SDslu, 59 SDs, 0 SdLazy, 137 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax100 hnf93 lsp56 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf91 smp100 dnf100 smp100 tf101 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 176ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 58 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 26.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...