./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/Ex07_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/Ex07_false-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 f77d0d21d7cb1d6a29608eb65655982c4edaf4ed ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:22:14,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:22:14,693 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:22:14,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:22:14,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:22:14,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:22:14,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:22:14,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:22:14,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:22:14,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:22:14,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:22:14,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:22:14,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:22:14,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:22:14,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:22:14,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:22:14,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:22:14,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:22:14,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:22:14,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:22:14,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:22:14,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:22:14,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:22:14,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:22:14,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:22:14,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:22:14,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:22:14,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:22:14,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:22:14,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:22:14,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:22:14,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:22:14,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:22:14,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:22:14,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:22:14,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:22:14,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:22:14,771 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:22:14,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:22:14,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:22:14,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:22:14,774 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:22:14,774 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:22:14,774 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:22:14,775 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:22:14,775 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:22:14,775 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:22:14,775 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:22:14,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:22:14,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:22:14,777 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:22:14,778 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:22:14,778 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:22:14,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:22:14,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:22:14,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:22:14,778 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:22:14,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:22:14,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:22:14,780 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:22:14,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:22:14,782 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 -> f77d0d21d7cb1d6a29608eb65655982c4edaf4ed [2019-01-14 02:22:14,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:22:14,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:22:14,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:22:14,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:22:14,849 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:22:14,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/Ex07_false-termination_true-no-overflow.c [2019-01-14 02:22:14,915 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e692fb964/e1daa43704104eec8b38b4759b457e49/FLAGb232dd5c3 [2019-01-14 02:22:15,355 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:22:15,356 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/Ex07_false-termination_true-no-overflow.c [2019-01-14 02:22:15,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e692fb964/e1daa43704104eec8b38b4759b457e49/FLAGb232dd5c3 [2019-01-14 02:22:15,760 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e692fb964/e1daa43704104eec8b38b4759b457e49 [2019-01-14 02:22:15,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:22:15,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:22:15,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:15,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:22:15,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:22:15,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:15" (1/1) ... [2019-01-14 02:22:15,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4bc483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:15, skipping insertion in model container [2019-01-14 02:22:15,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:15" (1/1) ... [2019-01-14 02:22:15,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:22:15,798 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:22:15,964 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:15,969 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:22:15,986 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:16,004 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:22:16,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16 WrapperNode [2019-01-14 02:22:16,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:16,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:16,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:22:16,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:22:16,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:16,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:22:16,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:22:16,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:22:16,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (1/1) ... [2019-01-14 02:22:16,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:22:16,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:22:16,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:22:16,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:22:16,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22: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-14 02:22:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:22:16,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:22:16,491 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:22:16,492 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:22:16,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:16 BoogieIcfgContainer [2019-01-14 02:22:16,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:22:16,494 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:22:16,494 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:22:16,498 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:22:16,499 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:16,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:22:15" (1/3) ... [2019-01-14 02:22:16,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73dbc34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:16, skipping insertion in model container [2019-01-14 02:22:16,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:16,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:16" (2/3) ... [2019-01-14 02:22:16,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73dbc34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:16, skipping insertion in model container [2019-01-14 02:22:16,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:16,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:16" (3/3) ... [2019-01-14 02:22:16,503 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ex07_false-termination_true-no-overflow.c [2019-01-14 02:22:16,562 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:22:16,562 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:22:16,563 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:22:16,563 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:22:16,563 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:22:16,563 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:22:16,563 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:22:16,563 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:22:16,563 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:22:16,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:22:16,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:22:16,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:16,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:16,609 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:16,609 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:16,609 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:22:16,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:22:16,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:22:16,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:16,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:16,611 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:16,611 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:16,620 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L13-1true [2019-01-14 02:22:16,621 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(0 != ~unnamed0~0~true); 3#L10true assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; 9#L10-2true assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; 5#L13-1true [2019-01-14 02:22:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:22:16,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2019-01-14 02:22:16,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:22:16,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:16,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:22:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:22:16,825 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-14 02:22:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:16,895 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2019-01-14 02:22:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:22:16,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2019-01-14 02:22:16,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:22:16,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:22:16,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:22:16,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:22:16,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:22:16,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:16,912 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:22:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:22:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:22:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:22:16,987 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:16,988 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:16,988 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:22:16,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:22:16,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:22:16,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:16,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:16,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:16,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:16,990 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 28#L13-1 [2019-01-14 02:22:16,990 INFO L796 eck$LassoCheckResult]: Loop: 28#L13-1 assume !!(0 != ~unnamed0~0~true); 24#L10 assume !(main_~i~0 > 0); 26#L10-2 assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; 28#L13-1 [2019-01-14 02:22:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:22:16,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2019-01-14 02:22:16,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:17,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 1 times [2019-01-14 02:22:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:17,138 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:17,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:17,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:17,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:17,140 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:17,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:17,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:17,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex07_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:22:17,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:17,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:17,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-14 02:22:17,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:17,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:17,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:17,314 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:17,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:17,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:17,352 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:22:17,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:17,366 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,414 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:17,414 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:17,422 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:17,448 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:17,491 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:17,496 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:17,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:17,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:17,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:17,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:17,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:17,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:17,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:17,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex07_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:22:17,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:17,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:17,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:17,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:17,746 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:17,751 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:17,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:17,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:17,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:17,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:17,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:17,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:17,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:17,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:17,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:17,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:17,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:17,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:17,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:17,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:17,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:17,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:17,778 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:17,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:17,782 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:22:17,784 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:17,785 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:17,785 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:17,785 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:17,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:17,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:17,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:17,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:22:17,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:22:17,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 19 states and 26 transitions. Complement of second has 8 states. [2019-01-14 02:22:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 02:22:18,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:22:18,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:18,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:22:18,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:18,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:22:18,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:18,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 02:22:18,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:22:18,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 17 transitions. [2019-01-14 02:22:18,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:22:18,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:22:18,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:22:18,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:18,006 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:22:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:22:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 02:22:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:22:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:22:18,009 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:22:18,009 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:22:18,009 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:22:18,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:22:18,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:22:18,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:18,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:18,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:18,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:18,011 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 92#L13-1 assume !!(0 != ~unnamed0~0~true); 96#L10 assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; 98#L10-2 [2019-01-14 02:22:18,011 INFO L796 eck$LassoCheckResult]: Loop: 98#L10-2 assume !(main_~i~0 < 0); 93#L13-1 assume !!(0 != ~unnamed0~0~true); 94#L10 assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; 98#L10-2 [2019-01-14 02:22:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:22:18,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:18,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 50295, now seen corresponding path program 1 times [2019-01-14 02:22:18,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:18,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 925775829, now seen corresponding path program 1 times [2019-01-14 02:22:18,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:18,177 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-14 02:22:18,218 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:18,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:18,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:18,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:18,219 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:18,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:18,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:18,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:18,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex07_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:22:18,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:18,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:18,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:18,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:18,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-14 02:22:18,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:18,310 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:18,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:18,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:18,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:18,338 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:18,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:18,344 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:18,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:18,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:18,393 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:18,395 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:18,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:18,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:18,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:18,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:18,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:18,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:18,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:18,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ex07_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:22:18,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:18,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:18,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:18,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:18,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-14 02:22:18,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:18,593 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:18,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:18,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:18,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:18,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:18,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:18,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:18,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:18,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:18,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:18,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:18,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:22:18,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:18,608 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:18,608 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:18,608 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:18,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:18,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:18,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:18,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:22:18,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:22:19,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-01-14 02:22:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-14 02:22:19,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:22:19,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:19,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:22:19,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:19,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:22:19,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:19,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-14 02:22:19,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:22:19,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2019-01-14 02:22:19,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:22:19,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:22:19,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-14 02:22:19,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:19,102 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:22:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-14 02:22:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-01-14 02:22:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:22:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 02:22:19,105 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:19,105 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:19,105 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:22:19,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-14 02:22:19,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:22:19,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:19,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:19,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:19,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:19,107 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 161#L13-1 assume !!(0 != ~unnamed0~0~true); 168#L10 assume !(main_~i~0 > 0); 156#L10-2 [2019-01-14 02:22:19,107 INFO L796 eck$LassoCheckResult]: Loop: 156#L10-2 assume !(main_~i~0 < 0); 162#L13-1 assume !!(0 != ~unnamed0~0~true); 155#L10 assume !(main_~i~0 > 0); 156#L10-2 [2019-01-14 02:22:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:22:19,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash 50297, now seen corresponding path program 1 times [2019-01-14 02:22:19,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:19,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 925835413, now seen corresponding path program 1 times [2019-01-14 02:22:19,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:19,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:22:19 BoogieIcfgContainer [2019-01-14 02:22:19,248 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:22:19,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:22:19,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:22:19,250 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:22:19,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:16" (3/4) ... [2019-01-14 02:22:19,260 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:22:19,301 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:22:19,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:22:19,302 INFO L168 Benchmark]: Toolchain (without parser) took 3537.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.7 MB in the beginning and 992.4 MB in the end (delta: -39.7 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:19,303 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:19,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:19,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:19,305 INFO L168 Benchmark]: Boogie Preprocessor took 32.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:19,305 INFO L168 Benchmark]: RCFGBuilder took 402.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:19,306 INFO L168 Benchmark]: BuchiAutomizer took 2753.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.4 MB in the end (delta: 139.9 MB). Peak memory consumption was 139.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:19,307 INFO L168 Benchmark]: Witness Printer took 52.34 ms. Allocated memory is still 1.2 GB. Free memory is still 992.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:19,311 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2753.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.4 MB in the end (delta: 139.9 MB). Peak memory consumption was 139.9 MB. Max. memory is 11.5 GB. * Witness Printer took 52.34 ms. Allocated memory is still 1.2 GB. Free memory is still 992.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 13 SDslu, 5 SDs, 0 SdLazy, 24 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax220 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f380332=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE \read(true) [L10] COND FALSE !(i > 0) Loop: [L13] COND FALSE !(i < 0) [L9] COND TRUE \read(true) [L10] COND FALSE !(i > 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...