./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Sunset.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-restricted-15/Sunset.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.25-f470102 [2019-11-28 20:31:25,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:31:25,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:31:25,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:31:25,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:31:25,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:31:25,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:31:25,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:31:25,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:31:25,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:31:25,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:31:25,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:31:25,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:31:25,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:31:25,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:31:25,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:31:25,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:31:25,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:31:25,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:31:25,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:31:25,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:31:25,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:31:25,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:31:25,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:31:25,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:31:25,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:31:25,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:31:25,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:31:25,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:31:25,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:31:25,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:31:25,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:31:25,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:31:25,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:31:25,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:31:25,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:31:25,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:31:25,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:31:25,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:31:25,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:31:25,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:31:25,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:31:25,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:31:25,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:31:25,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:31:25,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:31:25,439 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:31:25,440 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:31:25,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:31:25,440 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:31:25,440 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:31:25,440 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:31:25,441 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:31:25,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:31:25,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:31:25,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:31:25,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:31:25,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:31:25,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:31:25,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:31:25,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:31:25,443 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:31:25,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:31:25,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:31:25,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:31:25,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:31:25,444 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:31:25,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:31:25,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:31:25,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:31:25,445 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:31:25,446 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:31:25,446 INFO L138 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-11-28 20:31:25,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:31:25,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:31:25,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:31:25,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:31:25,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:31:25,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Sunset.c [2019-11-28 20:31:25,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee73880c/c4336cb2942f4cb68497c674c0390ff7/FLAG7c8231297 [2019-11-28 20:31:26,339 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:31:26,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Sunset.c [2019-11-28 20:31:26,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee73880c/c4336cb2942f4cb68497c674c0390ff7/FLAG7c8231297 [2019-11-28 20:31:26,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee73880c/c4336cb2942f4cb68497c674c0390ff7 [2019-11-28 20:31:26,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:31:26,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:31:26,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:26,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:31:26,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:31:26,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:26,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d698f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26, skipping insertion in model container [2019-11-28 20:31:26,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:26,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:31:26,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:31:26,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:26,937 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:31:26,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:26,971 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:31:26,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26 WrapperNode [2019-11-28 20:31:26,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:26,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:26,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:31:26,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:31:26,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:26,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:27,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:31:27,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:31:27,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:31:27,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (1/1) ... [2019-11-28 20:31:27,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:31:27,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:31:27,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:31:27,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:31:27,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (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-11-28 20:31:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:31:27,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:31:27,293 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:31:27,294 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:31:27,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:27 BoogieIcfgContainer [2019-11-28 20:31:27,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:31:27,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:31:27,296 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:31:27,299 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:31:27,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:27,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:31:26" (1/3) ... [2019-11-28 20:31:27,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f7153a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:27, skipping insertion in model container [2019-11-28 20:31:27,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:27,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:26" (2/3) ... [2019-11-28 20:31:27,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f7153a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:27, skipping insertion in model container [2019-11-28 20:31:27,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:27,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:27" (3/3) ... [2019-11-28 20:31:27,303 INFO L371 chiAutomizerObserver]: Analyzing ICFG Sunset.c [2019-11-28 20:31:27,352 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:31:27,352 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:31:27,353 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:31:27,353 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:31:27,353 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:31:27,353 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:31:27,353 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:31:27,353 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:31:27,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:31:27,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:31:27,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:27,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:27,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:27,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:27,394 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:31:27,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:31:27,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:31:27,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:27,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:27,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:27,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:27,403 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-11-28 20:31:27,403 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-11-28 20:31:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:31:27,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:27,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420466833] [2019-11-28 20:31:27,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2019-11-28 20:31:27,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:27,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612509356] [2019-11-28 20:31:27,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2019-11-28 20:31:27,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:27,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713227886] [2019-11-28 20:31:27,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:27,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:27,673 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-11-28 20:31:27,787 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:27,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:27,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:27,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:27,789 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:27,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:27,790 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:27,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:27,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2019-11-28 20:31:27,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:27,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:27,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:27,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:27,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:27,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:27,979 INFO L404 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-11-28 20:31:27,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:27,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:27,996 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:27,997 INFO L440 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-11-28 20:31:28,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:28,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:28,014 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:28,015 INFO L440 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) [2019-11-28 20:31:28,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:28,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:28,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:28,058 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:28,060 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:28,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:28,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:28,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:28,061 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:28,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:28,062 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:28,062 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2019-11-28 20:31:28,062 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:28,063 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:28,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:28,155 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:31:28,162 INFO L120 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-11-28 20:31:28,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:28,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:28,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:28,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:28,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:28,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 20:31:28,204 INFO L120 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 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:28,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:28,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:28,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:28,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:28,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:28,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:28,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:28,219 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:28,220 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2019-11-28 20:31:28,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:28,236 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:28,236 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:28,238 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-11-28 20:31:28,245 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:28,302 WARN L262 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:28,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:28,317 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:28,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:28,362 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-11-28 20:31:28,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-11-28 20:31:28,425 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-11-28 20:31:28,426 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-11-28 20:31:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:31:28,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-28 20:31:28,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:28,432 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:28,452 WARN L262 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:28,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:28,460 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:28,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:28,474 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-11-28 20:31:28,475 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-11-28 20:31:28,511 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-11-28 20:31:28,512 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-11-28 20:31:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-28 20:31:28,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-28 20:31:28,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:28,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:31:28,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:28,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-28 20:31:28,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:28,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-11-28 20:31:28,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:31:28,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2019-11-28 20:31:28,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:31:28,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:31:28,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2019-11-28 20:31:28,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:28,527 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-11-28 20:31:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2019-11-28 20:31:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 20:31:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:31:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-11-28 20:31:28,558 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 20:31:28,558 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 20:31:28,558 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:31:28,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-11-28 20:31:28,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:31:28,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:28,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:28,560 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:31:28,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:28,560 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-11-28 20:31:28,560 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-11-28 20:31:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 20:31:28,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:28,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868857149] [2019-11-28 20:31:28,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2019-11-28 20:31:28,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:28,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910751432] [2019-11-28 20:31:28,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2019-11-28 20:31:28,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:28,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718390785] [2019-11-28 20:31:28,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:28,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:28,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:28,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:28,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:28,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:28,619 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:28,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:28,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:28,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2019-11-28 20:31:28,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:28,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:28,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,694 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:28,694 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:28,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:28,707 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,712 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:28,712 INFO L440 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 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-11-28 20:31:28,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:28,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:28,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:28,733 INFO L440 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:28,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:28,748 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-28 20:31:28,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:28,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:28,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:28,785 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:28,785 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:28,785 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:28,786 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:28,786 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:28,786 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:28,786 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:28,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:28,787 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2019-11-28 20:31:28,787 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:28,787 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:28,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:28,879 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:28,879 INFO L489 LassoAnalysis]: Using template 'affine'. 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-11-28 20:31:28,890 INFO L120 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-11-28 20:31:28,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:28,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:28,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:28,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:28,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:28,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:28,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-11-28 20:31:28,918 INFO L120 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-11-28 20:31:28,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:28,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:28,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:28,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:28,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:28,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:28,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-11-28 20:31:28,951 INFO L120 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-11-28 20:31:28,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:28,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:28,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:28,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:28,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:28,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:28,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:28,961 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:28,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:28,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2019-11-28 20:31:28,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:28,979 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:28,980 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:28,980 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-11-28 20:31:28,983 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,042 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:29,056 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-11-28 20:31:29,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:31:29,092 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-11-28 20:31:29,094 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-11-28 20:31:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 20:31:29,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-28 20:31:29,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:31:29,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-28 20:31:29,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2019-11-28 20:31:29,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:31:29,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2019-11-28 20:31:29,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:31:29,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:31:29,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2019-11-28 20:31:29,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:29,103 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-11-28 20:31:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2019-11-28 20:31:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 20:31:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:31:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2019-11-28 20:31:29,114 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-11-28 20:31:29,114 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-11-28 20:31:29,114 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:31:29,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2019-11-28 20:31:29,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:31:29,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:29,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:29,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:29,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:29,125 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-11-28 20:31:29,125 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-11-28 20:31:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2019-11-28 20:31:29,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701984276] [2019-11-28 20:31:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:29,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701984276] [2019-11-28 20:31:29,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:29,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:31:29,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117067755] [2019-11-28 20:31:29,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:31:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2019-11-28 20:31:29,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:29,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522367134] [2019-11-28 20:31:29,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:29,267 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:29,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:29,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:29,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:29,268 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:29,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:29,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:29,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2019-11-28 20:31:29,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:29,269 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:29,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:29,335 INFO L404 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) [2019-11-28 20:31:29,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:29,349 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:29,355 INFO L440 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 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-11-28 20:31:29,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:29,373 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-11-28 20:31:29,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:29,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:29,391 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:29,393 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:29,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:29,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:29,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:29,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:29,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:29,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:29,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2019-11-28 20:31:29,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:29,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,463 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:29,463 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:31:29,473 INFO L120 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-11-28 20:31:29,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:29,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:29,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:29,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:29,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:29,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:29,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:29,484 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:29,484 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:29,503 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:29,503 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:29,503 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-11-28 20:31:29,505 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,545 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:29,564 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-11-28 20:31:29,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 20:31:29,595 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-11-28 20:31:29,598 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-11-28 20:31:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:29,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:31:29,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,601 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:29,635 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:29,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:29,650 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-11-28 20:31:29,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 20:31:29,684 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-11-28 20:31:29,685 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-11-28 20:31:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 20:31:29,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:31:29,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:31:29,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:31:29,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:29,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2019-11-28 20:31:29,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 20:31:29,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2019-11-28 20:31:29,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 20:31:29,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:31:29,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2019-11-28 20:31:29,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:29,694 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2019-11-28 20:31:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2019-11-28 20:31:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 20:31:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:31:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2019-11-28 20:31:29,706 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2019-11-28 20:31:29,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:29,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:31:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:31:29,711 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2019-11-28 20:31:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:29,736 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-11-28 20:31:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:31:29,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-11-28 20:31:29,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:31:29,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-11-28 20:31:29,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:31:29,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:31:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-11-28 20:31:29,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:29,742 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-28 20:31:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-11-28 20:31:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-11-28 20:31:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:31:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-28 20:31:29,748 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 20:31:29,748 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 20:31:29,749 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:31:29,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-28 20:31:29,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:31:29,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:29,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:29,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-11-28 20:31:29,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:29,754 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-11-28 20:31:29,754 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-11-28 20:31:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2019-11-28 20:31:29,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:29,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488016836] [2019-11-28 20:31:29,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2019-11-28 20:31:29,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:29,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099142557] [2019-11-28 20:31:29,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,790 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2019-11-28 20:31:29,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:29,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067398818] [2019-11-28 20:31:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:29,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:29,844 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:29,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:29,844 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:29,844 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:29,845 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:29,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:29,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:29,845 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2019-11-28 20:31:29,845 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:29,845 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:29,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-11-28 20:31:29,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,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-11-28 20:31:29,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:29,901 INFO L404 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-11-28 20:31:29,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:29,911 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-11-28 20:31:29,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:29,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:29,936 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:29,939 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:29,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:29,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:29,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:29,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:29,939 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:29,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:29,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:29,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2019-11-28 20:31:29,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:29,941 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:29,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:29,996 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:29,996 INFO L489 LassoAnalysis]: Using template 'affine'. 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-11-28 20:31:30,004 INFO L120 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-11-28 20:31:30,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:30,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:30,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:30,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:30,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:30,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:30,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:30,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:30,017 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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-11-28 20:31:30,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:30,022 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:30,023 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:30,023 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-11-28 20:31:30,025 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,097 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:30,109 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-11-28 20:31:30,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:30,144 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-11-28 20:31:30,144 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-11-28 20:31:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:30,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:31:30,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,145 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,169 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:30,177 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-11-28 20:31:30,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:30,198 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-11-28 20:31:30,199 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-11-28 20:31:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:30,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:31:30,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,199 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,225 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:30,234 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-11-28 20:31:30,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:30,267 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-11-28 20:31:30,268 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-11-28 20:31:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-28 20:31:30,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:31:30,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 20:31:30,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-28 20:31:30,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. [2019-11-28 20:31:30,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:31:30,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2019-11-28 20:31:30,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:31:30,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:31:30,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2019-11-28 20:31:30,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:30,274 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-11-28 20:31:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2019-11-28 20:31:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2019-11-28 20:31:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:31:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-11-28 20:31:30,276 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 20:31:30,277 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 20:31:30,277 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:31:30,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-11-28 20:31:30,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:31:30,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:30,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:30,278 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:30,278 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:30,279 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-11-28 20:31:30,279 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-11-28 20:31:30,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2019-11-28 20:31:30,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672011307] [2019-11-28 20:31:30,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2019-11-28 20:31:30,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041787131] [2019-11-28 20:31:30,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2019-11-28 20:31:30,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597713522] [2019-11-28 20:31:30,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,320 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:30,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:30,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:30,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:30,321 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:30,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:30,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:30,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2019-11-28 20:31:30,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:30,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:30,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,430 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:30,430 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 20:31:30,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:30,443 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:30,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:30,457 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:30,491 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:30,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:30,491 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:30,491 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:30,491 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:30,491 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,491 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:30,492 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:30,492 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2019-11-28 20:31:30,492 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:30,492 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:30,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,597 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:30,597 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:30,605 INFO L120 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-11-28 20:31:30,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:30,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:30,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:30,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:30,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:30,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 20:31:30,629 INFO L120 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-11-28 20:31:30,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:30,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:30,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:30,631 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:31:30,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:30,634 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:31:30,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:30,645 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:31:30,645 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:30,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:30,650 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:30,650 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:30,650 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 20:31:30,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:30,685 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:30,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:30,695 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-11-28 20:31:30,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:31:30,720 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-11-28 20:31:30,721 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-11-28 20:31:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:30,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:31:30,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:31:30,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:31:30,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:30,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-28 20:31:30,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:31:30,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2019-11-28 20:31:30,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:31:30,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:31:30,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2019-11-28 20:31:30,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:30,725 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-28 20:31:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2019-11-28 20:31:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 20:31:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:31:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-11-28 20:31:30,728 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 20:31:30,728 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 20:31:30,728 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:31:30,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-11-28 20:31:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:31:30,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:30,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:30,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-28 20:31:30,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:30,730 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-11-28 20:31:30,731 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-11-28 20:31:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2019-11-28 20:31:30,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762202467] [2019-11-28 20:31:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2019-11-28 20:31:30,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172924641] [2019-11-28 20:31:30,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2019-11-28 20:31:30,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:30,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754407016] [2019-11-28 20:31:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:30,761 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:30,793 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:30,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:30,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:30,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:30,793 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:30,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:30,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:30,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2019-11-28 20:31:30,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:30,794 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:30,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,893 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:30,893 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:30,897 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:30,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:30,935 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:30,937 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:30,938 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:30,938 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:30,938 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:30,938 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:30,938 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:30,938 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:30,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:30,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2019-11-28 20:31:30,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:30,939 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:30,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-11-28 20:31:30,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:30,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:31,030 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,035 INFO L120 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-11-28 20:31:31,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:31,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:31,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:31,037 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:31:31,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:31,039 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:31:31,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:31,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:31,045 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:31:31,045 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:31,049 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:31,049 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:31,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 20:31:31,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,083 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,100 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-11-28 20:31:31,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:31,114 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-11-28 20:31:31,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-11-28 20:31:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:31,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:31:31,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,116 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,142 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,159 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-11-28 20:31:31,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:31,169 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-11-28 20:31:31,170 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-11-28 20:31:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:31:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,171 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,197 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,206 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-11-28 20:31:31,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 20:31:31,220 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-11-28 20:31:31,220 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-11-28 20:31:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 20:31:31,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:31:31,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:31:31,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 20:31:31,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. [2019-11-28 20:31:31,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:31:31,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2019-11-28 20:31:31,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:31:31,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:31:31,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-11-28 20:31:31,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:31,226 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 20:31:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-11-28 20:31:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-11-28 20:31:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:31:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 20:31:31,228 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 20:31:31,228 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 20:31:31,228 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:31:31,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 20:31:31,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:31,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:31,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:31,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:31,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-28 20:31:31,230 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-11-28 20:31:31,230 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-11-28 20:31:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2019-11-28 20:31:31,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647733138] [2019-11-28 20:31:31,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2019-11-28 20:31:31,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115512333] [2019-11-28 20:31:31,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,246 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2019-11-28 20:31:31,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637529699] [2019-11-28 20:31:31,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,256 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:31,282 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:31,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:31,282 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:31,282 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:31,282 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:31,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:31,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:31,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2019-11-28 20:31:31,283 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:31,283 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:31,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:31,342 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:31,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:31,353 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:31,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:31,364 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,370 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:31,372 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:31,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:31,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:31,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:31,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:31,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:31,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:31,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2019-11-28 20:31:31,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:31,373 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:31,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-11-28 20:31:31,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,419 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:31,420 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,427 INFO L120 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-11-28 20:31:31,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:31,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:31,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:31,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:31,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:31,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:31,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:31,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:31,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:31,440 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:31,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:31,448 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:31,448 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:31,448 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-11-28 20:31:31,450 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,493 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-11-28 20:31:31,493 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 20:31:31,522 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-11-28 20:31:31,522 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-11-28 20:31:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 20:31:31,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:31:31,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,524 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,538 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,563 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-11-28 20:31:31,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 20:31:31,608 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-11-28 20:31:31,609 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-11-28 20:31:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 20:31:31,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:31:31,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:31:31,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:31,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:31,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2019-11-28 20:31:31,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:31,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2019-11-28 20:31:31,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:31:31,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:31:31,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2019-11-28 20:31:31,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:31,615 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-11-28 20:31:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2019-11-28 20:31:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-11-28 20:31:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:31:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-28 20:31:31,618 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 20:31:31,618 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 20:31:31,618 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:31:31,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-28 20:31:31,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:31,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:31,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:31,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2019-11-28 20:31:31,620 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-28 20:31:31,621 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-11-28 20:31:31,621 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-11-28 20:31:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2019-11-28 20:31:31,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75192340] [2019-11-28 20:31:31,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2019-11-28 20:31:31,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969506644] [2019-11-28 20:31:31,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:31,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2019-11-28 20:31:31,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:31,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857395363] [2019-11-28 20:31:31,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:31:31,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857395363] [2019-11-28 20:31:31,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167884843] [2019-11-28 20:31:31,723 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:31:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:31:31,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:31:31,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:31:31,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114066789] [2019-11-28 20:31:31,778 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:31,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:31,779 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:31,779 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:31,779 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:31,779 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,779 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:31,779 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:31,779 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2019-11-28 20:31:31,780 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:31,780 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:31,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:31,829 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:31,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:31,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:31,837 INFO L440 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:31,845 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:31,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:31,857 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:31,859 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:31,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:31,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:31,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:31,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:31,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:31,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:31,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2019-11-28 20:31:31,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:31,860 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:31,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:31,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:31,907 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:31,913 INFO L120 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 Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:31,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:31,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:31,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:31,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:31,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:31,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,925 INFO L120 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-11-28 20:31:31,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:31,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:31,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:31,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:31,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:31,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:31,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:31,929 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:31,931 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:31,931 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:31,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:31,936 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:31,936 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:31,936 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-11-28 20:31:31,938 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:31,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:31,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:31,988 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-11-28 20:31:31,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 20:31:32,017 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-11-28 20:31:32,018 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-11-28 20:31:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 20:31:32,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 20:31:32,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,019 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,067 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-11-28 20:31:32,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 20:31:32,095 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-11-28 20:31:32,096 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-11-28 20:31:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 20:31:32,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 20:31:32,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,097 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,139 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-11-28 20:31:32,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 20:31:32,169 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-11-28 20:31:32,172 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-11-28 20:31:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 20:31:32,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 20:31:32,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,173 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,226 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-11-28 20:31:32,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 20:31:32,294 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-11-28 20:31:32,294 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-11-28 20:31:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-28 20:31:32,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 20:31:32,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 20:31:32,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 20:31:32,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2019-11-28 20:31:32,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 20:31:32,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2019-11-28 20:31:32,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:31:32,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:31:32,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2019-11-28 20:31:32,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:32,301 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-11-28 20:31:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2019-11-28 20:31:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2019-11-28 20:31:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:31:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-11-28 20:31:32,306 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-11-28 20:31:32,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:31:32,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:31:32,306 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2019-11-28 20:31:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:32,336 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-11-28 20:31:32,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:31:32,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2019-11-28 20:31:32,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 20:31:32,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2019-11-28 20:31:32,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:31:32,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 20:31:32,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-28 20:31:32,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:32,339 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 20:31:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-28 20:31:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-11-28 20:31:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:31:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 20:31:32,342 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 20:31:32,343 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 20:31:32,343 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:31:32,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-28 20:31:32,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:31:32,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:32,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:32,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:32,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-28 20:31:32,345 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-11-28 20:31:32,345 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-11-28 20:31:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2019-11-28 20:31:32,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:32,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544487399] [2019-11-28 20:31:32,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:32,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2019-11-28 20:31:32,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:32,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218266877] [2019-11-28 20:31:32,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2019-11-28 20:31:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397584510] [2019-11-28 20:31:32,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:32,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:32,411 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:32,411 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:32,411 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:32,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:32,412 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:32,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:32,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:32,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2019-11-28 20:31:32,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:32,412 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:32,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:32,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:32,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:32,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:32,461 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:32,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:32,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:32,474 INFO L440 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:32,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:32,486 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:32,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:32,498 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,505 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:32,507 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:32,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:32,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:32,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:32,508 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:32,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:32,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:32,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2019-11-28 20:31:32,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:32,510 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:32,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:32,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-11-28 20:31:32,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:32,562 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:32,562 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:32,569 INFO L120 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 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:32,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:32,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:32,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:32,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:32,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:32,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,581 INFO L120 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-11-28 20:31:32,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:32,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:32,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:32,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:32,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:32,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:32,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,595 INFO L120 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-11-28 20:31:32,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:32,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:32,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:32,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:32,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:32,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:32,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:32,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:32,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:32,606 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:32,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:32,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:32,627 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:32,627 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:32,630 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,666 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,702 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-11-28 20:31:32,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:31:32,716 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-11-28 20:31:32,717 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-11-28 20:31:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:32,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 20:31:32,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,718 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,776 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-11-28 20:31:32,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:31:32,794 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-11-28 20:31:32,794 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-11-28 20:31:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 20:31:32,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 20:31:32,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,795 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,874 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-11-28 20:31:32,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:31:32,896 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-11-28 20:31:32,897 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-11-28 20:31:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 20:31:32,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 20:31:32,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,898 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:32,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:32,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:32,959 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-11-28 20:31:32,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:31:32,982 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-11-28 20:31:32,983 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-11-28 20:31:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 20:31:32,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 20:31:32,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:32,984 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,053 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-11-28 20:31:33,054 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 20:31:33,151 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-11-28 20:31:33,152 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-11-28 20:31:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-11-28 20:31:33,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 20:31:33,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2019-11-28 20:31:33,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2019-11-28 20:31:33,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2019-11-28 20:31:33,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 20:31:33,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2019-11-28 20:31:33,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:31:33,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:31:33,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2019-11-28 20:31:33,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:33,163 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-11-28 20:31:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2019-11-28 20:31:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2019-11-28 20:31:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 20:31:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2019-11-28 20:31:33,168 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-11-28 20:31:33,168 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-11-28 20:31:33,168 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:31:33,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2019-11-28 20:31:33,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 20:31:33,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:33,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:33,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:33,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-28 20:31:33,170 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-11-28 20:31:33,171 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-11-28 20:31:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2019-11-28 20:31:33,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641307236] [2019-11-28 20:31:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2019-11-28 20:31:33,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:33,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261750592] [2019-11-28 20:31:33,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2019-11-28 20:31:33,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:33,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860927348] [2019-11-28 20:31:33,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:33,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:33,247 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:33,248 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:33,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:33,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:33,248 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:33,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:33,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:33,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:33,248 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2019-11-28 20:31:33,248 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:33,249 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:33,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:33,289 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:33,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:33,301 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:33,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:33,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:33,315 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:33,317 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:33,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:33,317 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:33,317 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:33,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:33,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:33,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:33,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:33,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2019-11-28 20:31:33,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:33,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:33,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:33,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:33,366 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:33,376 INFO L120 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-11-28 20:31:33,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:33,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:33,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:33,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:33,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:33,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:33,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:33,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:33,384 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:33,384 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:33,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:33,388 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:33,388 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:33,388 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2019-11-28 20:31:33,390 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,466 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-11-28 20:31:33,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 20:31:33,488 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-11-28 20:31:33,493 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-11-28 20:31:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:31:33,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:33,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,494 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,568 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-11-28 20:31:33,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 20:31:33,592 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-11-28 20:31:33,593 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-11-28 20:31:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 20:31:33,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:33,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,594 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,672 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-11-28 20:31:33,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 20:31:33,685 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-11-28 20:31:33,686 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-11-28 20:31:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 20:31:33,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:33,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,687 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,703 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,757 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-11-28 20:31:33,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 20:31:33,784 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-11-28 20:31:33,784 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-11-28 20:31:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 20:31:33,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:33,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:33,785 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:33,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:33,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:33,852 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-11-28 20:31:33,852 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 20:31:33,998 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-11-28 20:31:33,998 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-11-28 20:31:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2019-11-28 20:31:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:31:34,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2019-11-28 20:31:34,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:34,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2019-11-28 20:31:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:34,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. [2019-11-28 20:31:34,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-28 20:31:34,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2019-11-28 20:31:34,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:31:34,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:31:34,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2019-11-28 20:31:34,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:34,016 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2019-11-28 20:31:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2019-11-28 20:31:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2019-11-28 20:31:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 20:31:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2019-11-28 20:31:34,024 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-11-28 20:31:34,024 INFO L591 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-11-28 20:31:34,024 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:31:34,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2019-11-28 20:31:34,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-28 20:31:34,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:34,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:34,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:31:34,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2019-11-28 20:31:34,027 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-11-28 20:31:34,027 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-11-28 20:31:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2019-11-28 20:31:34,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:34,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46852748] [2019-11-28 20:31:34,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2019-11-28 20:31:34,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:34,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067473171] [2019-11-28 20:31:34,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2019-11-28 20:31:34,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:34,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123440896] [2019-11-28 20:31:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:34,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:34,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:31:34 BoogieIcfgContainer [2019-11-28 20:31:34,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:31:34,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:31:34,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:31:34,147 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:31:34,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:27" (3/4) ... [2019-11-28 20:31:34,150 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:31:34,196 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:31:34,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:31:34,198 INFO L168 Benchmark]: Toolchain (without parser) took 7472.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -89.0 MB). Peak memory consumption was 214.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:34,199 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:34,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.53 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:34,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:34,201 INFO L168 Benchmark]: Boogie Preprocessor took 80.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:34,201 INFO L168 Benchmark]: RCFGBuilder took 201.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:34,202 INFO L168 Benchmark]: BuchiAutomizer took 6850.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 232.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:34,202 INFO L168 Benchmark]: Witness Printer took 49.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:34,206 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.53 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 201.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6850.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 232.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 6.7s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 3.7s. Construction of modules took 0.4s. Büchi inclusion checks took 2.2s. 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.4s 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: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - 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@796b6184=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...