./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-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/Sunset_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 a80d10d797b477078e6dad6d87594a2a0aea1065 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 21:39:44,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:39:44,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:39:44,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:39:44,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:39:44,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:39:44,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:39:44,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:39:44,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:39:44,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:39:44,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:39:44,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:39:44,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:39:44,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:39:44,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:39:44,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:39:44,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:39:44,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:39:44,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:39:44,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:39:44,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:39:44,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:39:44,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:39:44,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:39:44,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:39:44,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:39:44,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:39:44,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:39:44,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:39:44,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:39:44,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:39:44,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:39:44,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:39:44,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:39:44,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:39:44,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:39:44,153 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:39:44,179 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:39:44,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:39:44,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:39:44,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:39:44,182 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:39:44,182 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:39:44,184 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:39:44,184 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:39:44,185 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:39:44,185 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:39:44,185 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:39:44,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:39:44,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:39:44,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:39:44,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:39:44,187 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:39:44,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:39:44,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:39:44,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:39:44,189 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:39:44,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:39:44,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:39:44,190 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:39:44,191 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:39:44,191 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 -> a80d10d797b477078e6dad6d87594a2a0aea1065 [2019-01-01 21:39:44,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:39:44,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:39:44,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:39:44,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:39:44,276 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:39:44,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2019-01-01 21:39:44,348 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f98d254/9fbce47383b048e383023ca85b0b2d0d/FLAG155101c2d [2019-01-01 21:39:44,838 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:39:44,839 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2019-01-01 21:39:44,846 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f98d254/9fbce47383b048e383023ca85b0b2d0d/FLAG155101c2d [2019-01-01 21:39:45,171 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f98d254/9fbce47383b048e383023ca85b0b2d0d [2019-01-01 21:39:45,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:39:45,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:39:45,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:45,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:39:45,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:39:45,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2966e2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45, skipping insertion in model container [2019-01-01 21:39:45,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:39:45,219 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:39:45,401 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:45,406 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:39:45,424 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:45,439 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:39:45,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45 WrapperNode [2019-01-01 21:39:45,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:45,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:45,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:39:45,441 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:39:45,451 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:39:45" (1/1) ... [2019-01-01 21:39:45,457 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:39:45" (1/1) ... [2019-01-01 21:39:45,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:45,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:39:45,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:39:45,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:39:45,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (1/1) ... [2019-01-01 21:39:45,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:39:45,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:39:45,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:39:45,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:39:45,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (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:39:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:39:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:39:45,869 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:39:45,870 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:39:45,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:45 BoogieIcfgContainer [2019-01-01 21:39:45,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:39:45,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:39:45,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:39:45,875 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:39:45,876 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:45,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:39:45" (1/3) ... [2019-01-01 21:39:45,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58ca824e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:45, skipping insertion in model container [2019-01-01 21:39:45,878 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:45,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:45" (2/3) ... [2019-01-01 21:39:45,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58ca824e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:45, skipping insertion in model container [2019-01-01 21:39:45,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:45,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:45" (3/3) ... [2019-01-01 21:39:45,881 INFO L375 chiAutomizerObserver]: Analyzing ICFG Sunset_false-termination_true-no-overflow.c [2019-01-01 21:39:45,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:39:45,938 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:39:45,938 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:39:45,938 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:39:45,938 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:39:45,938 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:39:45,938 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:39:45,939 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:39:45,939 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:39:45,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:39:45,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:39:45,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:45,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:45,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:45,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:45,989 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:39:45,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:39:45,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:39:45,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:45,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:45,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:45,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:46,001 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-01 21:39:46,002 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(main_~i~0 > 10); 3#L10true assume 25 == main_~i~0;main_~i~0 := 30; 8#L10-2true assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 5#L13-1true [2019-01-01 21:39:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:39:46,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2019-01-01 21:39:46,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:46,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2019-01-01 21:39:46,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:46,356 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-01 21:39:46,399 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:46,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:46,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:46,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:46,401 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:46,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:46,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:46,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:46,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:46,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:46,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:46,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:46,474 INFO 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:39:46,511 INFO 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:39:46,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:46,876 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:46,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:46,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:46,917 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:39:46,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:46,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:46,954 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:39:46,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:46,965 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) [2019-01-01 21:39:47,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:47,016 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:47,028 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:47,046 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:47,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:47,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:47,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:47,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:47,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:47,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:47,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:47,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:47,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:47,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:47,051 INFO 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:39:47,059 INFO 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:39:47,073 INFO 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:39:47,289 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:39:47,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:47,358 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:47,360 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:39:47,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:47,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:47,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:47,379 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:39:47,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:47,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:47,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:47,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:47,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:47,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:47,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:47,394 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:47,400 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:47,401 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:47,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:47,403 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:47,403 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:47,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-01-01 21:39:47,405 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,592 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:39:47,607 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:39:47,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-01 21:39:47,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:39:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:39:47,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:39:47,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,692 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:47,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:47,845 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:39:47,845 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:47,845 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-01 21:39:47,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 8 states. [2019-01-01 21:39:47,934 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:39:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-01 21:39:47,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:39:47,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:39:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:39:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:47,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-01-01 21:39:47,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:39:47,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2019-01-01 21:39:47,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:39:47,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:39:47,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2019-01-01 21:39:47,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:47,956 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-01-01 21:39:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2019-01-01 21:39:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:39:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:39:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-01-01 21:39:47,989 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-01 21:39:47,989 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-01 21:39:47,989 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:39:47,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-01-01 21:39:47,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:39:47,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:47,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:47,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:39:47,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:47,991 INFO L794 eck$LassoCheckResult]: Stem: 126#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; 127#L13-1 assume !!(main_~i~0 > 10); 130#L10 assume !(25 == main_~i~0); 123#L10-2 [2019-01-01 21:39:47,991 INFO L796 eck$LassoCheckResult]: Loop: 123#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 128#L13-1 assume !!(main_~i~0 > 10); 122#L10 assume 25 == main_~i~0;main_~i~0 := 30; 123#L10-2 [2019-01-01 21:39:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:39:47,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2019-01-01 21:39:48,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2019-01-01 21:39:48,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:48,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:48,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:48,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:48,107 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:48,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:48,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:48,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:48,108 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:48,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:48,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:48,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:48,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:39:48,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:48,109 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:48,110 INFO 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:39:48,115 INFO 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:39:48,119 INFO 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:39:48,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:48,182 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:39:48,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:48,208 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:39:48,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:48,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:48,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:48,255 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:48,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:48,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:48,327 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:48,357 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:48,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:48,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:48,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:48,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:48,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:48,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:48,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:48,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:39:48,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:48,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:48,362 INFO 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:39:48,404 INFO 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:39:48,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:48,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:48,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:48,734 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:39:48,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:48,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:48,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:48,746 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:39:48,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:48,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:48,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:48,760 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:39:48,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:48,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:48,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:48,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:48,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:48,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:48,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:48,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:48,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:48,775 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:48,775 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:48,775 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:48,776 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:48,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-01-01 21:39:48,776 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:48,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:48,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:48,887 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:39:48,887 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:39:48,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:39:48,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 34 transitions. Complement of second has 5 states. [2019-01-01 21:39:48,944 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:39:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:39:48,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:39:48,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:48,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:39:48,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:48,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:39:48,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:48,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2019-01-01 21:39:48,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:39:48,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2019-01-01 21:39:48,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:39:48,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:39:48,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2019-01-01 21:39:48,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:48,951 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-01-01 21:39:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2019-01-01 21:39:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-01 21:39:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:39:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2019-01-01 21:39:48,954 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-01-01 21:39:48,954 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-01-01 21:39:48,954 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:39:48,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2019-01-01 21:39:48,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:39:48,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:48,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:48,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:48,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:48,957 INFO L794 eck$LassoCheckResult]: Stem: 197#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; 198#L13-1 assume !!(main_~i~0 > 10); 205#L10 assume 25 == main_~i~0;main_~i~0 := 30; 206#L10-2 assume !(main_~i~0 <= 30);main_~i~0 := 20; 199#L13-1 [2019-01-01 21:39:48,957 INFO L796 eck$LassoCheckResult]: Loop: 199#L13-1 assume !!(main_~i~0 > 10); 200#L10 assume 25 == main_~i~0;main_~i~0 := 30; 210#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 199#L13-1 [2019-01-01 21:39:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2019-01-01 21:39:48,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:48,999 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:39:49,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:49,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:39:49,004 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2019-01-01 21:39:49,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,122 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:49,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:49,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:49,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:49,123 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:49,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:49,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:49,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:39:49,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:49,124 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:49,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:49,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:49,164 INFO 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:39:49,268 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:49,268 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:49,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:49,299 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:49,299 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 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:39:49,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:49,305 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:49,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:49,339 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:49,358 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:49,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:49,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:49,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:49,359 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:49,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:49,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:49,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:39:49,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:49,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:49,361 INFO 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:39:49,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:49,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:49,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:49,492 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:49,492 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:39:49,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:49,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:49,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:49,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:49,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:49,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:49,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:49,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:49,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:49,506 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:49,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:49,507 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:49,508 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:49,508 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-01-01 21:39:49,508 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:49,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:49,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:49,580 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:39:49,581 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:39:49,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 21:39:49,649 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 66 transitions. Complement of second has 5 states. [2019-01-01 21:39:49,652 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:39:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:49,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:39:49,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,653 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:49,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:49,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:49,710 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:39:49,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:49,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 21:39:49,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 44 states and 70 transitions. Complement of second has 7 states. [2019-01-01 21:39:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:39:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:39:49,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:39:49,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:49,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2019-01-01 21:39:49,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 21:39:49,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2019-01-01 21:39:49,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:49,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:39:49,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2019-01-01 21:39:49,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:49,803 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2019-01-01 21:39:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2019-01-01 21:39:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-01 21:39:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:39:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2019-01-01 21:39:49,808 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2019-01-01 21:39:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:39:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:39:49,816 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2019-01-01 21:39:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:49,851 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-01-01 21:39:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:39:49,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-01-01 21:39:49,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:39:49,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-01-01 21:39:49,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:39:49,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:39:49,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-01-01 21:39:49,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:49,858 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-01 21:39:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-01-01 21:39:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-01-01 21:39:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:39:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-01 21:39:49,862 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:39:49,862 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:39:49,863 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:39:49,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-01 21:39:49,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:39:49,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:49,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:49,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-01 21:39:49,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:49,866 INFO L794 eck$LassoCheckResult]: Stem: 441#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; 442#L13-1 assume !!(main_~i~0 > 10); 453#L10 assume !(25 == main_~i~0); 457#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 449#L13-1 assume !!(main_~i~0 > 10); 437#L10 assume !(25 == main_~i~0); 438#L10-2 [2019-01-01 21:39:49,866 INFO L796 eck$LassoCheckResult]: Loop: 438#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 443#L13-1 assume !!(main_~i~0 > 10); 444#L10 assume 25 == main_~i~0;main_~i~0 := 30; 438#L10-2 [2019-01-01 21:39:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2019-01-01 21:39:49,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2019-01-01 21:39:49,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2019-01-01 21:39:49,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:49,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:49,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:49,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:49,937 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:49,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:49,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:49,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:49,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:49,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:49,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:49,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:49,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:39:49,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:49,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:49,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:49,950 INFO 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:39:49,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:50,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:50,060 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:50,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:50,090 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:50,109 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:50,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:50,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:50,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:50,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:50,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:50,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:50,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:39:50,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:50,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:50,113 INFO 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:39:50,124 INFO 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:39:50,127 INFO 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:39:50,194 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,194 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:50,195 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:39:50,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:50,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:50,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:50,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:50,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:50,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:50,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:50,206 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:50,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:50,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:50,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:50,210 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:50,210 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:50,212 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-01-01 21:39:50,212 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,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:39:50,268 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:39:50,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:50,294 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2019-01-01 21:39:50,295 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:39:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:50,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:39:50,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,296 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,345 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:39:50,345 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:50,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:50,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2019-01-01 21:39:50,370 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:39:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:50,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:39:50,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,371 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,419 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:39:50,420 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:50,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:50,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 31 states and 47 transitions. Complement of second has 6 states. [2019-01-01 21:39:50,449 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:39:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:39:50,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:39:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 21:39:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 21:39:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. [2019-01-01 21:39:50,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:50,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2019-01-01 21:39:50,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:39:50,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:39:50,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2019-01-01 21:39:50,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:50,456 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-01-01 21:39:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2019-01-01 21:39:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2019-01-01 21:39:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:39:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-01-01 21:39:50,458 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:39:50,458 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:39:50,458 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:39:50,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-01-01 21:39:50,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:50,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:50,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:50,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:50,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:50,460 INFO L794 eck$LassoCheckResult]: Stem: 664#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; 665#L13-1 assume !!(main_~i~0 > 10); 671#L10 assume !(25 == main_~i~0); 672#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2019-01-01 21:39:50,460 INFO L796 eck$LassoCheckResult]: Loop: 666#L13-1 assume !!(main_~i~0 > 10); 660#L10 assume !(25 == main_~i~0); 661#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2019-01-01 21:39:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2019-01-01 21:39:50,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2019-01-01 21:39:50,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2019-01-01 21:39:50,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:50,514 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:50,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:50,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:50,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:50,514 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:50,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:50,515 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:50,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:39:50,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:50,515 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:50,516 INFO 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:39:50,546 INFO 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:39:50,549 INFO 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:39:50,651 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,652 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:50,661 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:50,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:50,723 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:50,724 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:50,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:50,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:50,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:50,725 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:50,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:50,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:50,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:50,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:39:50,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:50,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:50,727 INFO 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:39:50,729 INFO 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:39:50,746 INFO 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:39:50,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:50,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:50,877 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:39:50,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:50,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:50,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:50,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:50,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:50,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:50,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:50,884 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:39:50,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:50,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:50,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:50,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:39:50,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:50,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:50,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:50,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:50,902 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:50,902 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:50,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:50,903 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:50,903 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:50,904 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-01 21:39:50,904 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:50,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:50,973 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:39:50,974 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:39:50,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:39:50,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:39:50,995 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:39:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:50,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:39:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:39:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:50,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:50,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-01-01 21:39:50,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:50,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2019-01-01 21:39:50,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:39:50,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:39:50,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2019-01-01 21:39:50,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:50,999 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-01-01 21:39:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2019-01-01 21:39:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-01 21:39:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:39:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-01-01 21:39:51,003 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-01 21:39:51,003 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-01 21:39:51,003 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:39:51,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-01-01 21:39:51,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:39:51,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:51,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:51,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-01 21:39:51,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:51,005 INFO L794 eck$LassoCheckResult]: Stem: 753#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; 754#L13-1 assume !!(main_~i~0 > 10); 768#L10 assume !(25 == main_~i~0); 769#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 756#L13-1 assume !!(main_~i~0 > 10); 757#L10 assume 25 == main_~i~0;main_~i~0 := 30; 760#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2019-01-01 21:39:51,005 INFO L796 eck$LassoCheckResult]: Loop: 761#L13-1 assume !!(main_~i~0 > 10); 771#L10 assume !(25 == main_~i~0); 773#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2019-01-01 21:39:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2019-01-01 21:39:51,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2019-01-01 21:39:51,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2019-01-01 21:39:51,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,078 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:51,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:51,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:51,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:51,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:51,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:51,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:51,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:39:51,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:51,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:51,082 INFO 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:39:51,108 INFO 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:39:51,112 INFO 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:39:51,264 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2019-01-01 21:39:51,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:51,275 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:51,285 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:51,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:51,359 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:51,361 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:51,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:51,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:51,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:51,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:51,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:51,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:51,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:39:51,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:51,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:51,363 INFO 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:39:51,381 INFO 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:39:51,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:51,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:51,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:51,466 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:39:51,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:51,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:51,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:51,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:39:51,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:51,469 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:51,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:51,475 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:51,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:51,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:51,479 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:51,479 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:51,480 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:51,480 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-01 21:39:51,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,552 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:39:51,553 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:39:51,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:51,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:39:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:51,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:39:51,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,615 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:39:51,615 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:51,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:51,630 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:39:51,632 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:39:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:51,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:39:51,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,633 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:51,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:51,670 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:39:51,671 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:39:51,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:39:51,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 52 transitions. Complement of second has 4 states. [2019-01-01 21:39:51,701 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:39:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:39:51,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:39:51,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:39:51,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:39:51,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:51,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. [2019-01-01 21:39:51,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:39:51,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2019-01-01 21:39:51,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:39:51,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:39:51,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-01-01 21:39:51,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:51,706 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-01 21:39:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-01-01 21:39:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-01-01 21:39:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:39:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-01-01 21:39:51,713 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-01-01 21:39:51,713 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-01-01 21:39:51,713 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:39:51,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-01-01 21:39:51,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:39:51,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:51,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:51,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:51,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-01-01 21:39:51,720 INFO L794 eck$LassoCheckResult]: Stem: 1006#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; 1007#L13-1 assume !!(main_~i~0 > 10); 1012#L10 assume !(25 == main_~i~0); 1013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2019-01-01 21:39:51,721 INFO L796 eck$LassoCheckResult]: Loop: 1008#L13-1 assume !!(main_~i~0 > 10); 1005#L10 assume !(25 == main_~i~0); 1004#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1011#L13-1 assume !!(main_~i~0 > 10); 1015#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1014#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2019-01-01 21:39:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2019-01-01 21:39:51,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2019-01-01 21:39:51,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:51,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2019-01-01 21:39:51,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:51,836 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:51,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:51,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:51,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:51,836 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:51,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:51,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:51,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:39:51,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:51,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:51,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:51,846 INFO 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:39:51,855 INFO 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:39:51,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:51,924 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:51,929 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:51,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:51,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:51,986 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:52,012 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:52,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:52,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:52,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:52,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:52,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:52,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:52,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:39:52,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:52,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:52,014 INFO 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:39:52,027 INFO 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:39:52,032 INFO 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:39:52,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:52,073 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:52,074 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:39:52,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:52,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:52,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:52,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:52,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:52,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:52,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:52,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:52,081 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:52,081 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:52,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:52,082 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:52,082 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:52,082 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-01-01 21:39:52,082 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:52,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:52,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:39:52,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 7 states. [2019-01-01 21:39:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:39:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:52,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:52,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:52,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:39:52,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 9 states. [2019-01-01 21:39:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 21:39:52,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:39:52,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:52,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:39:52,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:52,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:52,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:52,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2019-01-01 21:39:52,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:39:52,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2019-01-01 21:39:52,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:39:52,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:39:52,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2019-01-01 21:39:52,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:52,457 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-01-01 21:39:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2019-01-01 21:39:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-01-01 21:39:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:39:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-01-01 21:39:52,462 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-01 21:39:52,462 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-01 21:39:52,462 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:39:52,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-01-01 21:39:52,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:39:52,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:52,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:52,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2019-01-01 21:39:52,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-01-01 21:39:52,466 INFO L794 eck$LassoCheckResult]: Stem: 1226#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; 1227#L13-1 assume !!(main_~i~0 > 10); 1234#L10 assume !(25 == main_~i~0); 1235#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1228#L13-1 assume !!(main_~i~0 > 10); 1230#L10 assume !(25 == main_~i~0); 1251#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1247#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2019-01-01 21:39:52,467 INFO L796 eck$LassoCheckResult]: Loop: 1237#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2019-01-01 21:39:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2019-01-01 21:39:52,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:52,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:52,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2019-01-01 21:39:52,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:52,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:52,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:52,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2019-01-01 21:39:52,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:52,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 21:39:52,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:52,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:52,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:52,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 21:39:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:39:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:39:52,711 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:52,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:52,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:52,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:52,711 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:52,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:52,712 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:52,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:39:52,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:52,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:52,713 INFO 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:39:52,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:52,731 INFO 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:39:52,804 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:52,804 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:52,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:52,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:52,830 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:52,835 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:39:52,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:52,859 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:52,895 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:52,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:52,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:52,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:52,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:52,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:52,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:52,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:52,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:39:52,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:52,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:52,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:52,904 INFO 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:39:52,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:52,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:52,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:52,960 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:39:52,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:52,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:52,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:52,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:52,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:52,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:52,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:52,966 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:39:52,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:52,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:52,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:52,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:52,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:52,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:52,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:52,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:52,972 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:52,972 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:52,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:52,972 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:52,973 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:52,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-01-01 21:39:52,973 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:53,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:53,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 21:39:53,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 81 states and 107 transitions. Complement of second has 7 states. [2019-01-01 21:39:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:39:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:39:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:53,241 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:53,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 21:39:53,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 9 states. [2019-01-01 21:39:53,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 21:39:53,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:39:53,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,321 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:53,375 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 3 loop predicates [2019-01-01 21:39:53,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 21:39:53,405 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 101 states and 141 transitions. Complement of second has 10 states. [2019-01-01 21:39:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:39:53,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:39:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,410 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:53,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:53,474 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:53,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 21:39:53,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 76 states and 101 transitions. Complement of second has 11 states. [2019-01-01 21:39:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-01 21:39:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:39:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-01 21:39:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2019-01-01 21:39:53,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:53,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2019-01-01 21:39:53,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-01 21:39:53,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2019-01-01 21:39:53,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:39:53,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:39:53,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2019-01-01 21:39:53,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:53,527 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-01-01 21:39:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2019-01-01 21:39:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2019-01-01 21:39:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:39:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-01-01 21:39:53,530 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-01-01 21:39:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:39:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:39:53,531 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2019-01-01 21:39:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:53,587 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-01-01 21:39:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:39:53,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2019-01-01 21:39:53,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 21:39:53,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2019-01-01 21:39:53,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:39:53,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:39:53,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-01-01 21:39:53,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:53,591 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-01 21:39:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-01-01 21:39:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-01-01 21:39:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:39:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-01 21:39:53,597 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-01 21:39:53,597 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-01 21:39:53,597 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:39:53,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-01-01 21:39:53,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:39:53,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:53,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:53,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:53,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-01-01 21:39:53,600 INFO L794 eck$LassoCheckResult]: Stem: 1992#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; 1993#L13-1 assume !!(main_~i~0 > 10); 2008#L10 assume !(25 == main_~i~0); 2010#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2019-01-01 21:39:53,600 INFO L796 eck$LassoCheckResult]: Loop: 1994#L13-1 assume !!(main_~i~0 > 10); 1988#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1989#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1996#L13-1 assume !!(main_~i~0 > 10); 1990#L10 assume !(25 == main_~i~0); 1991#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1997#L13-1 assume !!(main_~i~0 > 10); 2014#L10 assume !(25 == main_~i~0); 2013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2019-01-01 21:39:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2019-01-01 21:39:53,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2019-01-01 21:39:53,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:53,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2019-01-01 21:39:53,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:53,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:53,694 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:53,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:53,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:53,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:53,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:53,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:53,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:53,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:53,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2019-01-01 21:39:53,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:53,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:53,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:53,740 INFO 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:39:53,823 INFO 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:39:53,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:53,992 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:53,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:53,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:54,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:54,017 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:54,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:54,022 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:54,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:54,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:54,049 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:54,067 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:54,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:54,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:54,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:54,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:54,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:54,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:54,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:54,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2019-01-01 21:39:54,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:54,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:54,069 INFO 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:39:54,073 INFO 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:39:54,077 INFO 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:39:54,173 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:54,173 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:54,173 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:39:54,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:54,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:54,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:54,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:54,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:54,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:54,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:54,182 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:39:54,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:54,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:54,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:54,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:54,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:54,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:54,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:54,192 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:39:54,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:54,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:54,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:54,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:54,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:54,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:54,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:54,197 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:54,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:54,199 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:54,200 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:54,200 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:54,200 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:54,200 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2019-01-01 21:39:54,200 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:39:54,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:39:54,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:39:54,366 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:39:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:39:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:54,367 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:39:54,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:39:54,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 40 states and 49 transitions. Complement of second has 7 states. [2019-01-01 21:39:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:39:54,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:39:54,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:54,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,579 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 4 loop predicates [2019-01-01 21:39:54,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:39:54,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 49 transitions. Complement of second has 5 states. [2019-01-01 21:39:54,590 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:39:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:39:54,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:39:54,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:54,592 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:54,659 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:39:54,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:39:54,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-01 21:39:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:39:54,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:39:54,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:54,821 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:54,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:55,033 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:39:55,034 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:39:55,163 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. Result 210 states and 292 transitions. Complement of second has 48 states 9 powerset states39 rank states. The highest rank that occured is 5 [2019-01-01 21:39:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-01-01 21:39:55,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:39:55,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:55,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2019-01-01 21:39:55,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:55,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2019-01-01 21:39:55,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:55,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2019-01-01 21:39:55,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:55,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2019-01-01 21:39:55,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:39:55,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:39:55,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2019-01-01 21:39:55,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:55,182 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-01-01 21:39:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2019-01-01 21:39:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2019-01-01 21:39:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 21:39:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2019-01-01 21:39:55,191 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-01-01 21:39:55,191 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-01-01 21:39:55,191 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:39:55,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2019-01-01 21:39:55,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 21:39:55,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:55,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:55,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:55,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-01-01 21:39:55,195 INFO L794 eck$LassoCheckResult]: Stem: 2689#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; 2691#L13-1 assume !!(main_~i~0 > 10); 2705#L10 assume !(25 == main_~i~0); 2701#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2019-01-01 21:39:55,195 INFO L796 eck$LassoCheckResult]: Loop: 2692#L13-1 assume !!(main_~i~0 > 10); 2693#L10 assume 25 == main_~i~0;main_~i~0 := 30; 2741#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2739#L13-1 assume !!(main_~i~0 > 10); 2734#L10 assume !(25 == main_~i~0); 2732#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2727#L13-1 assume !!(main_~i~0 > 10); 2714#L10 assume !(25 == main_~i~0); 2726#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2725#L13-1 assume !!(main_~i~0 > 10); 2698#L10 assume !(25 == main_~i~0); 2696#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2019-01-01 21:39:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2019-01-01 21:39:55,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2019-01-01 21:39:55,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:55,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:55,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:55,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2019-01-01 21:39:55,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:55,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:55,306 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:55,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:55,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:55,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:55,307 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:55,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:55,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:55,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:39:55,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:55,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:55,309 INFO 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:39:55,317 INFO 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:39:55,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:55,379 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:55,380 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:55,385 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:55,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:55,415 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:55,432 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:55,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:55,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:55,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:55,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:55,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:55,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:55,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:55,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:39:55,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:55,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:55,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:55,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:55,450 INFO 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:39:55,513 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:55,513 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:55,514 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:39:55,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:55,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:55,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:55,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:55,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:55,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:55,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:55,520 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:55,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:55,523 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:55,523 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:55,524 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:55,524 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:55,525 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2019-01-01 21:39:55,525 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:55,661 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:39:55,661 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-01-01 21:39:55,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2019-01-01 21:39:55,692 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:39:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:39:55,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:55,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:55,693 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:55,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:39:55,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-01-01 21:39:55,886 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 106 states and 135 transitions. Complement of second has 7 states. [2019-01-01 21:39:55,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:39:55,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:55,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:55,891 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:55,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:56,041 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 5 loop predicates [2019-01-01 21:39:56,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-01-01 21:39:56,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 95 states and 126 transitions. Complement of second has 5 states. [2019-01-01 21:39:56,115 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:39:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:39:56,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:56,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:56,279 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:39:56,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-01-01 21:39:56,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 99 states and 128 transitions. Complement of second has 6 states. [2019-01-01 21:39:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:39:56,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:56,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,326 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:56,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:56,482 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:39:56,482 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-01-01 21:39:56,728 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. Result 1058 states and 1452 transitions. Complement of second has 131 states 20 powerset states111 rank states. The highest rank that occured is 5 [2019-01-01 21:39:56,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2019-01-01 21:39:56,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:39:56,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2019-01-01 21:39:56,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2019-01-01 21:39:56,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:56,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. [2019-01-01 21:39:56,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-01-01 21:39:56,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2019-01-01 21:39:56,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:39:56,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:39:56,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2019-01-01 21:39:56,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:56,763 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2019-01-01 21:39:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2019-01-01 21:39:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2019-01-01 21:39:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 21:39:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2019-01-01 21:39:56,784 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-01-01 21:39:56,784 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-01-01 21:39:56,784 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:39:56,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2019-01-01 21:39:56,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-01 21:39:56,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:56,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:56,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:39:56,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2019-01-01 21:39:56,795 INFO L794 eck$LassoCheckResult]: Stem: 4641#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; 4645#L13-1 assume !!(main_~i~0 > 10); 4657#L10 assume !(25 == main_~i~0); 4655#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2019-01-01 21:39:56,795 INFO L796 eck$LassoCheckResult]: Loop: 4646#L13-1 assume !!(main_~i~0 > 10); 4647#L10 assume 25 == main_~i~0;main_~i~0 := 30; 4761#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4759#L13-1 assume !!(main_~i~0 > 10); 4757#L10 assume !(25 == main_~i~0); 4755#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4751#L13-1 assume !!(main_~i~0 > 10); 4748#L10 assume !(25 == main_~i~0); 4746#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4741#L13-1 assume !!(main_~i~0 > 10); 4660#L10 assume !(25 == main_~i~0); 4689#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4687#L13-1 assume !!(main_~i~0 > 10); 4652#L10 assume !(25 == main_~i~0); 4650#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2019-01-01 21:39:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2019-01-01 21:39:56,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:56,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2019-01-01 21:39:56,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:56,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2019-01-01 21:39:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:56,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:39:56 BoogieIcfgContainer [2019-01-01 21:39:56,981 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:39:56,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:39:56,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:39:56,982 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:39:56,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:45" (3/4) ... [2019-01-01 21:39:56,986 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:39:57,036 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:39:57,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:39:57,039 INFO L168 Benchmark]: Toolchain (without parser) took 11862.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:57,040 INFO L168 Benchmark]: CDTParser took 0.18 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:39:57,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.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:39:57,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:57,041 INFO L168 Benchmark]: Boogie Preprocessor took 24.61 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:57,044 INFO L168 Benchmark]: RCFGBuilder took 366.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -106.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:57,045 INFO L168 Benchmark]: BuchiAutomizer took 11110.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:57,046 INFO L168 Benchmark]: Witness Printer took 54.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:57,052 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.18 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 261.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.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 37.77 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.61 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 366.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -106.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11110.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (2 trivial, 5 deterministic, 5 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 27 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One deterministic module has affine ranking function -1 * i + 27 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 126 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 6.0s. Construction of modules took 0.8s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 5. Minimization of det autom 0. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 200 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 126 states and ocurred in iteration 10. Nontrivial modules had stage [2, 3, 2, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/33 HoareTripleCheckerStatistics: 173 SDtfs, 246 SDslu, 6 SDs, 0 SdLazy, 346 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax234 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf113 smp97 tf112 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: 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@1d9c1698=0, \result=0, i=25} - 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 i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 Loop: [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...