./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/c.08_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-restricted-15/c.08_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 8d821d1d8ee2aa872e0bf75fb913cf046d5ff3f8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38:48,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:38:48,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:38:48,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:38:48,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:38:48,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:38:48,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:38:48,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:38:48,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:38:48,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:38:48,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:38:48,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:38:48,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:38:48,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:38:48,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:38:48,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:38:48,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:38:48,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:38:48,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:38:48,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:38:48,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:38:48,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:38:48,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:38:48,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:38:48,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:38:48,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:38:48,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:38:48,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:38:48,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:38:48,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:38:48,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:38:48,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:38:48,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:38:48,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:38:48,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:38:48,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:38:48,746 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:38:48,772 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:38:48,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:38:48,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:38:48,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:38:48,775 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:38:48,775 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:38:48,775 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:38:48,775 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:38:48,775 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:38:48,775 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:38:48,776 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:38:48,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:38:48,776 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:38:48,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:38:48,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:38:48,777 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:38:48,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:38:48,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:38:48,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:38:48,778 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:38:48,778 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:38:48,779 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:38:48,779 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:38:48,780 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:38:48,780 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 -> 8d821d1d8ee2aa872e0bf75fb913cf046d5ff3f8 [2019-01-01 21:38:48,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:38:48,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:38:48,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:38:48,836 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:38:48,837 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:38:48,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/c.08_true-termination_true-no-overflow.c [2019-01-01 21:38:48,915 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274ac10c1/5eccfc69174d4230b43eff3275ee5263/FLAG3c32f9014 [2019-01-01 21:38:49,338 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:38:49,338 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/c.08_true-termination_true-no-overflow.c [2019-01-01 21:38:49,345 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274ac10c1/5eccfc69174d4230b43eff3275ee5263/FLAG3c32f9014 [2019-01-01 21:38:49,699 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274ac10c1/5eccfc69174d4230b43eff3275ee5263 [2019-01-01 21:38:49,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:38:49,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:38:49,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:38:49,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:38:49,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:38:49,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:38:49" (1/1) ... [2019-01-01 21:38:49,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:49, skipping insertion in model container [2019-01-01 21:38:49,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:38:49" (1/1) ... [2019-01-01 21:38:49,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:38:49,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:38:49,949 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:38:49,959 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:38:49,982 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:38:50,004 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:38:50,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50 WrapperNode [2019-01-01 21:38:50,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:38:50,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:38:50,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:38:50,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:38:50,017 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:38:50" (1/1) ... [2019-01-01 21:38:50,024 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:38:50" (1/1) ... [2019-01-01 21:38:50,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:38:50,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:38:50,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:38:50,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:38:50,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (1/1) ... [2019-01-01 21:38:50,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:38:50,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:38:50,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:38:50,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:38:50,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (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:38:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:38:50,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:38:50,463 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:38:50,463 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:38:50,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:38:50 BoogieIcfgContainer [2019-01-01 21:38:50,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:38:50,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:38:50,466 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:38:50,472 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:38:50,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:38:50,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:38:49" (1/3) ... [2019-01-01 21:38:50,474 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62a58597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:38:50, skipping insertion in model container [2019-01-01 21:38:50,474 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:38:50,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:38:50" (2/3) ... [2019-01-01 21:38:50,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62a58597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:38:50, skipping insertion in model container [2019-01-01 21:38:50,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:38:50,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:38:50" (3/3) ... [2019-01-01 21:38:50,479 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.08_true-termination_true-no-overflow.c [2019-01-01 21:38:50,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:38:50,634 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:38:50,634 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:38:50,634 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:38:50,634 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:38:50,634 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:38:50,635 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:38:50,635 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:38:50,635 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:38:50,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:38:50,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:38:50,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:38:50,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:38:50,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:38:50,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:38:50,697 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:38:50,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:38:50,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:38:50,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:38:50,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:38:50,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:38:50,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:38:50,712 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 8#L10-2true [2019-01-01 21:38:50,713 INFO L796 eck$LassoCheckResult]: Loop: 8#L10-2true assume !!(main_~i~0 >= 0);main_~j~0 := 0; 3#L12-2true assume !(main_~j~0 <= main_~i~0 - 1); 10#L12-3true main_~i~0 := main_~i~0 - 1; 8#L10-2true [2019-01-01 21:38:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:38:50,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:50,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:50,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:38:50,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-01 21:38:50,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:51,053 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:51,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:51,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:51,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:51,055 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:38:51,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:51,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:51,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:51,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:38:51,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:51,057 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:51,083 INFO 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:38:51,134 INFO 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:38:51,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:38:51,305 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:38:51,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:51,637 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:38:51,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:51,647 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:51,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:38:51,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:51,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:51,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:51,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:38:51,731 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-01 21:38:51,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:51,741 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-01 21:38:51,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:38:51,770 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:51,821 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:38:51,825 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:51,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:51,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:51,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:51,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:38:51,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:51,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:51,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:51,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:38:51,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:51,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:51,833 INFO 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:38:51,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:38:51,917 INFO 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:38:52,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:52,139 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:38:52,141 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:38:52,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:52,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:52,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:52,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:52,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:38:52,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:38:52,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:38:52,160 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:38:52,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:52,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:52,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:52,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:52,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:38:52,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:38:52,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:38:52,175 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:38:52,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:52,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:38:52,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:52,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:52,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:52,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:38:52,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:38:52,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:38:52,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:38:52,195 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:38:52,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:38:52,197 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:38:52,197 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:38:52,198 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-01-01 21:38:52,200 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:38:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:52,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:52,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:52,409 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:38:52,428 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-01 21:38:52,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:38:52,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:38:52,550 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-01 21:38:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:38:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-01 21:38:52,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:38:52,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:52,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:38:52,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:52,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:38:52,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:52,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-01 21:38:52,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:38:52,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:38:52,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:38:52,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:38:52,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:38:52,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:38:52,578 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:38:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:38:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-01 21:38:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:38:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-01 21:38:52,611 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-01 21:38:52,611 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-01 21:38:52,611 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:38:52,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-01 21:38:52,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:38:52,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:38:52,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:38:52,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:38:52,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:38:52,613 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 74#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 70#L12-2 [2019-01-01 21:38:52,613 INFO L796 eck$LassoCheckResult]: Loop: 70#L12-2 assume !!(main_~j~0 <= main_~i~0 - 1);main_~j~0 := 1 + main_~j~0; 70#L12-2 [2019-01-01 21:38:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:38:52,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:52,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:38:52,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:52,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:38:52,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:52,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:52,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:52,686 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:52,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:52,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:52,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:52,687 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:38:52,687 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:52,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:52,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:52,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:38:52,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:52,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:52,690 INFO 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:38:52,700 INFO 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:38:52,708 INFO 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:38:52,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:52,810 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-01 21:38:52,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:52,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:52,835 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:38:52,835 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-01 21:38:52,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:52,840 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-01 21:38:52,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:38:52,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:53,019 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:38:53,022 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:53,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:53,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:53,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:53,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:38:53,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:53,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:53,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:53,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:38:53,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:53,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:53,026 INFO 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:38:53,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:38:53,041 INFO 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:38:53,328 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:38:53,416 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:53,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:38:53,417 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:38:53,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:53,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:53,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:53,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:53,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:38:53,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:38:53,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:38:53,427 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:38:53,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:53,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:38:53,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:53,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:53,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:53,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:38:53,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:38:53,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:38:53,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:38:53,440 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:38:53,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:38:53,440 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:38:53,441 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:38:53,441 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:38:53,441 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:38:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:53,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:53,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:53,584 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:38:53,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:38:53,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-01 21:38:53,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2019-01-01 21:38:53,614 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-01 21:38:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:38:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:38:53,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-01 21:38:53,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:53,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:38:53,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:53,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:38:53,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:53,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-01 21:38:53,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:38:53,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-01 21:38:53,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:38:53,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:38:53,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-01 21:38:53,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:38:53,619 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:38:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-01 21:38:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-01 21:38:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:38:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:38:53,621 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:38:53,621 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:38:53,622 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:38:53,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-01 21:38:53,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:38:53,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:38:53,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:38:53,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:38:53,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:38:53,623 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~i~0, main_~j~0;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 122#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 119#L12-2 assume !(main_~j~0 <= main_~i~0 - 1); 120#L12-3 main_~i~0 := main_~i~0 - 1; 123#L10-2 assume !!(main_~i~0 >= 0);main_~j~0 := 0; 118#L12-2 [2019-01-01 21:38:53,624 INFO L796 eck$LassoCheckResult]: Loop: 118#L12-2 assume !!(main_~j~0 <= main_~i~0 - 1);main_~j~0 := 1 + main_~j~0; 118#L12-2 [2019-01-01 21:38:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-01 21:38:53,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:53,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:38:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:38:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:38:53,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:38:53,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:38:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:38:53,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:38:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:38:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:53,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:38:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:38:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:38:53,789 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:53,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:53,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:53,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:53,790 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:38:53,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:53,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:53,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:53,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:38:53,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:53,791 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:53,792 INFO 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:38:53,796 INFO 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:38:53,818 INFO 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:38:53,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:53,888 INFO L412 LassoAnalysis]: Checking for nontermination... 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:38:53,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:53,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:53,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:38:53,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:53,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:38:53,921 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:53,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:38:53,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:38:54,073 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:38:54,075 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:38:54,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:38:54,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:38:54,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:38:54,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:38:54,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:38:54,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:38:54,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:38:54,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.08_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:38:54,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:38:54,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:38:54,079 INFO 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:38:54,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:38:54,094 INFO 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:38:54,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:38:54,175 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:38:54,175 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:38:54,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:38:54,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:38:54,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:38:54,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:38:54,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:38:54,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:38:54,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:38:54,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:38:54,187 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:38:54,187 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:38:54,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:38:54,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:38:54,188 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:38:54,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 21:38:54,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:38:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,267 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:38:54,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:38:54,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:38:54,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-01 21:38:54,284 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-01 21:38:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:38:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:38:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:38:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:54,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:38:54,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,352 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:38:54,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:38:54,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:38:54,374 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-01 21:38:54,375 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-01 21:38:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:38:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:54,376 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:38:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:38:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:38:54,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:38:54,428 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:38:54,428 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:38:54,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:38:54,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2019-01-01 21:38:54,460 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-01 21:38:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:38:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:38:54,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:38:54,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:54,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:38:54,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:54,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:38:54,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:38:54,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-01 21:38:54,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:38:54,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:38:54,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:38:54,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:38:54,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:38:54,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:38:54,465 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:38:54,465 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:38:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:38:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:38:54,470 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 21:38:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:38:54,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:38:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:38:54,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:38:54,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:38:54,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:38:54,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:38:54,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:38:54,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:38:54,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:38:54,475 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:38:54,475 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:38:54,475 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:38:54,476 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:38:54,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:38:54,476 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:38:54,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:38:54,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:38:54 BoogieIcfgContainer [2019-01-01 21:38:54,484 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:38:54,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:38:54,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:38:54,484 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:38:54,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:38:50" (3/4) ... [2019-01-01 21:38:54,489 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:38:54,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:38:54,490 INFO L168 Benchmark]: Toolchain (without parser) took 4786.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 948.7 MB in the beginning and 924.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:38:54,492 INFO L168 Benchmark]: CDTParser took 0.17 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:38:54,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:38:54,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.54 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:38:54,494 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:38:54,494 INFO L168 Benchmark]: RCFGBuilder took 391.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:38:54,496 INFO L168 Benchmark]: BuchiAutomizer took 4017.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.9 MB in the end (delta: 186.4 MB). Peak memory consumption was 186.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:38:54,496 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 1.2 GB. Free memory is still 924.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:38:54,501 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.17 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 298.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 40.54 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4017.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.9 MB in the end (delta: 186.4 MB). Peak memory consumption was 186.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.57 ms. Allocated memory is still 1.2 GB. Free memory is still 924.9 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 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * j + i and consists of 3 locations. One nondeterministic module has affine ranking function i + -1 * j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 21 SDslu, 6 SDs, 0 SdLazy, 39 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax187 hnf98 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf110 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...