./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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/Narrowing.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 30c1dcaa423edd95f50127b236ab2e09f14129f4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:58:41,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:42,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:42,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:42,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:42,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:42,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:42,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:42,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:42,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:42,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:42,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:42,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:42,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:42,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:42,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:42,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:42,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:42,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:42,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:42,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:42,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:42,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:42,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:42,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:42,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:42,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:42,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:42,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:42,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:42,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:42,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:42,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:42,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:42,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:42,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:42,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:42,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:42,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:42,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:42,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:42,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:58:42,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:42,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:42,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:42,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:42,074 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:42,074 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:42,075 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:42,075 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:42,075 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:42,076 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:42,076 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:42,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:42,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:42,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:42,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:42,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:42,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:42,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:42,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:42,079 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:42,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:42,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:42,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:42,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:42,080 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:42,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:42,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:42,081 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:42,082 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:42,082 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 -> 30c1dcaa423edd95f50127b236ab2e09f14129f4 [2019-11-28 02:58:42,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:42,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:42,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:42,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:42,433 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:42,435 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2019-11-28 02:58:42,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67e2914/ca731f49c0864957bc8f4d36703b8aaa/FLAG39a8e9996 [2019-11-28 02:58:43,006 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:58:43,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2019-11-28 02:58:43,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67e2914/ca731f49c0864957bc8f4d36703b8aaa/FLAG39a8e9996 [2019-11-28 02:58:43,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67e2914/ca731f49c0864957bc8f4d36703b8aaa [2019-11-28 02:58:43,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:58:43,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:58:43,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:43,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:58:43,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:58:43,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b557634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43, skipping insertion in model container [2019-11-28 02:58:43,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:58:43,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:58:43,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:43,580 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:58:43,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:43,614 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:58:43,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43 WrapperNode [2019-11-28 02:58:43,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:43,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:43,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:58:43,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:58:43,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:43,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:58:43,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:58:43,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:58:43,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (1/1) ... [2019-11-28 02:58:43,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:58:43,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:58:43,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:58:43,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:58:43,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (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 02:58:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:58:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:58:43,964 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:58:43,964 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:58:43,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:43 BoogieIcfgContainer [2019-11-28 02:58:43,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:58:43,967 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:58:43,967 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:58:43,971 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:58:43,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:43,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:58:43" (1/3) ... [2019-11-28 02:58:43,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e26e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:43, skipping insertion in model container [2019-11-28 02:58:43,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:43,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:43" (2/3) ... [2019-11-28 02:58:43,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e26e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:43, skipping insertion in model container [2019-11-28 02:58:43,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:43,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:43" (3/3) ... [2019-11-28 02:58:43,977 INFO L371 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2019-11-28 02:58:44,029 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:58:44,030 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:58:44,030 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:58:44,030 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:58:44,030 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:58:44,031 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:58:44,031 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:58:44,031 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:58:44,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 02:58:44,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:58:44,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:44,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:44,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:44,089 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:44,089 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:58:44,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 02:58:44,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:58:44,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:44,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:44,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:44,093 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:44,105 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 13#L26-1true [2019-11-28 02:58:44,106 INFO L796 eck$LassoCheckResult]: Loop: 13#L26-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12#L14true assume 0 == main_~i~0;main_~up~0 := 1; 8#L14-2true assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5#L17-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11#L20-1true assume !(0 == main_~up~0); 7#L23-1true assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13#L26-1true [2019-11-28 02:58:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:58:44,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592873125] [2019-11-28 02:58:44,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1186392078, now seen corresponding path program 1 times [2019-11-28 02:58:44,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795451653] [2019-11-28 02:58:44,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:44,312 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 02:58:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795451653] [2019-11-28 02:58:44,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:44,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:44,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539037141] [2019-11-28 02:58:44,324 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:44,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:58:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:58:44,343 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-28 02:58:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:44,397 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-28 02:58:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:44,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-28 02:58:44,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:44,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 21 transitions. [2019-11-28 02:58:44,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 02:58:44,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 02:58:44,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. [2019-11-28 02:58:44,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:44,411 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-11-28 02:58:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. [2019-11-28 02:58:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 02:58:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:58:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2019-11-28 02:58:44,443 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-11-28 02:58:44,443 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2019-11-28 02:58:44,444 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:58:44,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2019-11-28 02:58:44,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:44,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:44,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:44,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:44,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:44,447 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 42#L26-1 [2019-11-28 02:58:44,447 INFO L796 eck$LassoCheckResult]: Loop: 42#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 47#L14 assume 0 == main_~i~0;main_~up~0 := 1; 48#L14-2 assume !(main_~i~0 == main_~range~0); 49#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 50#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 45#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 42#L26-1 [2019-11-28 02:58:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,447 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:58:44,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914246587] [2019-11-28 02:58:44,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1186451598, now seen corresponding path program 1 times [2019-11-28 02:58:44,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199012427] [2019-11-28 02:58:44,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:44,493 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 02:58:44,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199012427] [2019-11-28 02:58:44,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:44,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:58:44,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486748726] [2019-11-28 02:58:44,495 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:44,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:44,496 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 02:58:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:44,530 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-11-28 02:58:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:58:44,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-11-28 02:58:44,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:44,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 19 transitions. [2019-11-28 02:58:44,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 02:58:44,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 02:58:44,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-28 02:58:44,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:44,535 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:58:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-28 02:58:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 02:58:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:58:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-11-28 02:58:44,539 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:58:44,539 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:58:44,539 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:58:44,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-11-28 02:58:44,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:58:44,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:44,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:44,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:44,541 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:44,541 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 77#L26-1 [2019-11-28 02:58:44,541 INFO L796 eck$LassoCheckResult]: Loop: 77#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 80#L14 assume 0 == main_~i~0;main_~up~0 := 1; 81#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 74#L17-1 assume !(1 == main_~up~0); 75#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 78#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 77#L26-1 [2019-11-28 02:58:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 02:58:44,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361493437] [2019-11-28 02:58:44,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1186393938, now seen corresponding path program 1 times [2019-11-28 02:58:44,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632215807] [2019-11-28 02:58:44,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:44,586 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 02:58:44,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632215807] [2019-11-28 02:58:44,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:44,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:58:44,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452452663] [2019-11-28 02:58:44,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:44,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:44,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:44,588 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 02:58:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:44,671 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2019-11-28 02:58:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:44,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2019-11-28 02:58:44,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 02:58:44,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 43 transitions. [2019-11-28 02:58:44,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 02:58:44,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 02:58:44,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 43 transitions. [2019-11-28 02:58:44,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:58:44,677 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-28 02:58:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 43 transitions. [2019-11-28 02:58:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-11-28 02:58:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:58:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-28 02:58:44,684 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 02:58:44,684 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 02:58:44,684 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:58:44,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-28 02:58:44,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:44,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:44,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:44,686 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:44,686 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:44,686 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 126#L26-1 [2019-11-28 02:58:44,686 INFO L796 eck$LassoCheckResult]: Loop: 126#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 142#L14 assume !(0 == main_~i~0); 131#L14-2 assume !(main_~i~0 == main_~range~0); 127#L17-1 assume !(1 == main_~up~0); 128#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 143#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 126#L26-1 [2019-11-28 02:58:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 02:58:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690998458] [2019-11-28 02:58:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1188300564, now seen corresponding path program 1 times [2019-11-28 02:58:44,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565451740] [2019-11-28 02:58:44,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1363856397, now seen corresponding path program 1 times [2019-11-28 02:58:44,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:44,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442299354] [2019-11-28 02:58:44,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:44,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:44,831 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:44,832 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:44,832 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:44,832 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:44,832 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:44,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:44,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:44,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:44,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2019-11-28 02:58:44,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:44,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:44,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 02:58:44,865 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 02:58:44,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 02:58:44,873 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 02:58:44,997 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:44,998 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) [2019-11-28 02:58:45,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:45,017 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:45,027 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) [2019-11-28 02:58:45,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:45,046 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:45,053 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 02:58:45,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:45,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:45,079 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:45,080 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:58:45,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:45,097 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 02:58:45,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:45,119 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,139 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:45,141 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:45,142 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:45,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:45,142 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:45,142 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:45,142 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,142 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:45,143 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:45,143 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2019-11-28 02:58:45,143 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:45,143 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:45,145 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 02:58:45,156 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 02:58:45,161 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 02:58:45,165 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 02:58:45,295 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:45,307 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,316 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 02:58:45,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:45,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:45,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:45,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:45,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:45,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:45,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:45,329 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,341 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 02:58:45,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:45,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:45,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:45,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:45,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:45,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:45,354 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,367 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 02:58:45,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:45,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:45,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:45,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:45,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:45,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:45,382 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 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 02:58:45,401 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 02:58:45,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:45,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:45,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:45,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:45,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:45,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:45,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:45,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:45,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:45,421 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 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 02:58:45,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:45,437 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:45,437 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:45,438 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 02:58:45,445 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:45,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:45,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:45,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:45,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:45,544 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 02:58:45,548 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 02:58:45,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 02:58:45,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 54 states and 75 transitions. Complement of second has 7 states. [2019-11-28 02:58:45,631 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 02:58:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 02:58:45,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-28 02:58:45,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:45,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 02:58:45,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:45,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 12 letters. [2019-11-28 02:58:45,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:45,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 75 transitions. [2019-11-28 02:58:45,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:45,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 47 states and 64 transitions. [2019-11-28 02:58:45,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 02:58:45,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 02:58:45,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2019-11-28 02:58:45,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:45,654 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-11-28 02:58:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2019-11-28 02:58:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-11-28 02:58:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:58:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2019-11-28 02:58:45,667 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2019-11-28 02:58:45,668 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2019-11-28 02:58:45,668 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:58:45,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2019-11-28 02:58:45,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:45,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:45,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:45,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:58:45,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:45,671 INFO L794 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 253#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 270#L14 assume 0 == main_~i~0;main_~up~0 := 1; 278#L14-2 assume !(main_~i~0 == main_~range~0); 285#L17-1 [2019-11-28 02:58:45,672 INFO L796 eck$LassoCheckResult]: Loop: 285#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 272#L20-1 assume !(0 == main_~up~0); 273#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 284#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 288#L14 assume 0 == main_~i~0;main_~up~0 := 1; 286#L14-2 assume !(main_~i~0 == main_~range~0); 285#L17-1 [2019-11-28 02:58:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2019-11-28 02:58:45,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:45,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224549772] [2019-11-28 02:58:45,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:45,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880532, now seen corresponding path program 1 times [2019-11-28 02:58:45,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:45,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171340365] [2019-11-28 02:58:45,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:45,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 498642533, now seen corresponding path program 1 times [2019-11-28 02:58:45,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:45,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737089105] [2019-11-28 02:58:45,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:45,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737089105] [2019-11-28 02:58:45,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:45,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:58:45,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35158907] [2019-11-28 02:58:45,855 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:45,855 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:45,856 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:45,856 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:45,856 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:45,856 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:45,856 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:45,856 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:45,857 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2019-11-28 02:58:45,857 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:45,857 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:45,859 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 02:58:45,864 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 02:58:45,868 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 02:58:45,875 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 02:58:46,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:46,088 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 02:58:46,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:46,105 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:46,111 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:46,129 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:46,135 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:46,154 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:46,159 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:46,179 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:46,200 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,491 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:46,494 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:46,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:46,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:46,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:46,494 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:46,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:46,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:46,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2019-11-28 02:58:46,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:46,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:46,497 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 02:58:46,507 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 02:58:46,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 02:58:46,518 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 02:58:46,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:46,683 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,696 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 02:58:46,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:46,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:46,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:46,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:46,706 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,720 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:46,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:46,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:46,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:46,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:46,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:46,735 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:46,750 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 02:58:46,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:46,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:46,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:46,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:46,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:46,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:46,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,757 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,775 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 02:58:46,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:46,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:46,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:46,778 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:58:46,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:46,781 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:58:46,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:46,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:46,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:46,791 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 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) [2019-11-28 02:58:46,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:46,802 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:46,803 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:46,803 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:46,806 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:46,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:46,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:46,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:46,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:46,883 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 02:58:46,883 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 02:58:46,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-28 02:58:46,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 114 states and 153 transitions. Complement of second has 7 states. [2019-11-28 02:58:46,960 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 02:58:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 02:58:46,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:58:46,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:46,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:46,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:46,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:58:46,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:46,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 153 transitions. [2019-11-28 02:58:46,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2019-11-28 02:58:46,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 144 transitions. [2019-11-28 02:58:46,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2019-11-28 02:58:46,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-11-28 02:58:46,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 144 transitions. [2019-11-28 02:58:46,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:46,971 INFO L688 BuchiCegarLoop]: Abstraction has 108 states and 144 transitions. [2019-11-28 02:58:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 144 transitions. [2019-11-28 02:58:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2019-11-28 02:58:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:58:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-11-28 02:58:46,981 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-11-28 02:58:46,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:46,982 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 4 states. [2019-11-28 02:58:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:47,019 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-11-28 02:58:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:58:47,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 142 transitions. [2019-11-28 02:58:47,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2019-11-28 02:58:47,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 92 states and 118 transitions. [2019-11-28 02:58:47,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-28 02:58:47,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-11-28 02:58:47,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 118 transitions. [2019-11-28 02:58:47,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:47,031 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-11-28 02:58:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 118 transitions. [2019-11-28 02:58:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 41. [2019-11-28 02:58:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:58:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2019-11-28 02:58:47,039 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2019-11-28 02:58:47,040 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2019-11-28 02:58:47,040 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:58:47,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2019-11-28 02:58:47,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:47,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:47,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:47,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:58:47,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:47,042 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 669#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 684#L14 assume 0 == main_~i~0;main_~up~0 := 1; 693#L14-2 assume !(main_~i~0 == main_~range~0); 688#L17-1 [2019-11-28 02:58:47,042 INFO L796 eck$LassoCheckResult]: Loop: 688#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 689#L20-1 assume !(0 == main_~up~0); 690#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 699#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 704#L14 assume !(0 == main_~i~0); 701#L14-2 assume !(main_~i~0 == main_~range~0); 688#L17-1 [2019-11-28 02:58:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 2 times [2019-11-28 02:58:47,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:47,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634088936] [2019-11-28 02:58:47,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,052 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 1 times [2019-11-28 02:58:47,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:47,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398421813] [2019-11-28 02:58:47,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 498642595, now seen corresponding path program 1 times [2019-11-28 02:58:47,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:47,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947721876] [2019-11-28 02:58:47,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:47,158 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:47,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:47,159 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:47,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:47,159 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:47,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:47,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:47,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:47,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2019-11-28 02:58:47,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:47,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:47,161 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 02:58:47,176 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 02:58:47,179 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 02:58:47,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:47,309 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:47,309 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 02:58:47,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:47,320 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 02:58:47,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:47,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:47,535 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:47,537 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:47,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:47,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:47,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:47,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:47,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:47,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:47,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:47,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2019-11-28 02:58:47,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:47,539 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:47,541 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 02:58:47,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:47,555 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 02:58:47,558 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 02:58:47,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:47,715 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:47,721 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 02:58:47,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:47,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:47,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:47,722 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:58:47,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:47,725 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:58:47,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:47,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:47,753 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 02:58:47,753 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 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) [2019-11-28 02:58:47,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:47,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:47,759 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:47,759 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2019-11-28 02:58:47,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:47,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:47,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:47,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:47,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:47,813 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 02:58:47,814 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 02:58:47,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-28 02:58:47,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 90 states and 115 transitions. Complement of second has 7 states. [2019-11-28 02:58:47,861 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 02:58:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 02:58:47,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:58:47,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:47,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:47,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:47,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:58:47,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:47,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2019-11-28 02:58:47,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:47,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 77 states and 98 transitions. [2019-11-28 02:58:47,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-28 02:58:47,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-28 02:58:47,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 98 transitions. [2019-11-28 02:58:47,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:47,869 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2019-11-28 02:58:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 98 transitions. [2019-11-28 02:58:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-11-28 02:58:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 02:58:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-11-28 02:58:47,874 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-11-28 02:58:47,875 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-11-28 02:58:47,875 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:58:47,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 92 transitions. [2019-11-28 02:58:47,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:58:47,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:47,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:47,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:47,877 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:47,877 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 855#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 907#L14 assume !(0 == main_~i~0); 908#L14-2 assume !(main_~i~0 == main_~range~0); 852#L17-1 assume !(1 == main_~up~0); 853#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 900#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 901#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 913#L14 assume 0 == main_~i~0;main_~up~0 := 1; 912#L14-2 assume !(main_~i~0 == main_~range~0); 876#L17-1 [2019-11-28 02:58:47,877 INFO L796 eck$LassoCheckResult]: Loop: 876#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 877#L20-1 assume !(0 == main_~up~0); 856#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 857#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 887#L14 assume !(0 == main_~i~0); 885#L14-2 assume !(main_~i~0 == main_~range~0); 876#L17-1 [2019-11-28 02:58:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -255352415, now seen corresponding path program 1 times [2019-11-28 02:58:47,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:47,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134281703] [2019-11-28 02:58:47,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:47,902 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 02:58:47,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134281703] [2019-11-28 02:58:47,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268358587] [2019-11-28 02:58:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:47,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:58:47,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:47,935 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 02:58:47,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:47,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:58:47,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340897712] [2019-11-28 02:58:47,937 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1634880594, now seen corresponding path program 2 times [2019-11-28 02:58:47,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:47,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795042338] [2019-11-28 02:58:47,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:47,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:47,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:47,993 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:47,993 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:47,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:47,993 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:47,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:47,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:47,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:47,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2019-11-28 02:58:47,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:47,994 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:47,995 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 02:58:48,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:48,007 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 02:58:48,020 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 02:58:48,167 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:48,167 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:48,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:48,176 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:48,176 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:48,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:48,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:48,187 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:48,192 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:48,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:48,415 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:48,417 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:48,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:48,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:48,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:48,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:48,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:48,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:48,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2019-11-28 02:58:48,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:48,418 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:48,419 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 02:58:48,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:48,431 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 02:58:48,444 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 02:58:48,598 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:48,599 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:58:48,613 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 02:58:48,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:48,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:48,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:48,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:48,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:48,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:48,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,619 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:48,631 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 02:58:48,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:48,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:48,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:48,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:48,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:48,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,639 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:48,649 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 02:58:48,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:48,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:48,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:48,652 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:58:48,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:48,656 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:58:48,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:48,664 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:48,664 INFO L444 ModelExtractionUtils]: 1 out of 4 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) [2019-11-28 02:58:48,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:48,669 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:48,670 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:48,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2019-11-28 02:58:48,672 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,720 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 02:58:48,721 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 02:58:48,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-11-28 02:58:48,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 95 states and 121 transitions. Complement of second has 7 states. [2019-11-28 02:58:48,763 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 02:58:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 02:58:48,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:48,764 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,812 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 02:58:48,813 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 02:58:48,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-11-28 02:58:48,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 124 states and 157 transitions. Complement of second has 9 states. [2019-11-28 02:58:48,879 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 02:58:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-11-28 02:58:48,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:48,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:48,880 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:48,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:48,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:48,928 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 02:58:48,928 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 02:58:48,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand 4 states. [2019-11-28 02:58:48,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 112 states and 146 transitions. Complement of second has 8 states. [2019-11-28 02:58:48,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 02:58:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-11-28 02:58:48,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:58:48,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:48,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 02:58:48,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:48,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 02:58:48,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:48,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 146 transitions. [2019-11-28 02:58:48,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 02:58:48,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 84 states and 108 transitions. [2019-11-28 02:58:48,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 02:58:48,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-28 02:58:48,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 108 transitions. [2019-11-28 02:58:48,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:48,992 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 108 transitions. [2019-11-28 02:58:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 108 transitions. [2019-11-28 02:58:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 49. [2019-11-28 02:58:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:58:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-11-28 02:58:48,996 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-28 02:58:48,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:58:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:58:48,997 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2019-11-28 02:58:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:49,046 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2019-11-28 02:58:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:49,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 154 transitions. [2019-11-28 02:58:49,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-28 02:58:49,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 152 transitions. [2019-11-28 02:58:49,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-11-28 02:58:49,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-11-28 02:58:49,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 152 transitions. [2019-11-28 02:58:49,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:49,051 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 152 transitions. [2019-11-28 02:58:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 152 transitions. [2019-11-28 02:58:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-11-28 02:58:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:58:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-11-28 02:58:49,057 INFO L711 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-11-28 02:58:49,057 INFO L591 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-11-28 02:58:49,057 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:58:49,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 128 transitions. [2019-11-28 02:58:49,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-28 02:58:49,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:49,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:49,059 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:58:49,059 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 02:58:49,060 INFO L794 eck$LassoCheckResult]: Stem: 1646#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1647#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1657#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1658#L14-2 assume !(main_~i~0 == main_~range~0); 1699#L17-1 [2019-11-28 02:58:49,060 INFO L796 eck$LassoCheckResult]: Loop: 1699#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1696#L20-1 assume !(0 == main_~up~0); 1697#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1692#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1690#L14 assume !(0 == main_~i~0); 1688#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 1679#L17-1 assume !(1 == main_~up~0); 1687#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1686#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1682#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1683#L14 assume !(0 == main_~i~0); 1678#L14-2 assume !(main_~i~0 == main_~range~0); 1677#L17-1 assume !(1 == main_~up~0); 1676#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 1674#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1675#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1680#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1681#L14-2 assume !(main_~i~0 == main_~range~0); 1699#L17-1 [2019-11-28 02:58:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 3 times [2019-11-28 02:58:49,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968867535] [2019-11-28 02:58:49,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1416950548, now seen corresponding path program 1 times [2019-11-28 02:58:49,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987436454] [2019-11-28 02:58:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:49,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987436454] [2019-11-28 02:58:49,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719273970] [2019-11-28 02:58:49,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:58:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:49,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:58:49,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:49,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:49,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-28 02:58:49,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92252970] [2019-11-28 02:58:49,379 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:49,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:58:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:58:49,381 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. cyclomatic complexity: 35 Second operand 13 states. [2019-11-28 02:58:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:49,694 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2019-11-28 02:58:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:58:49,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 155 transitions. [2019-11-28 02:58:49,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2019-11-28 02:58:49,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 121 states and 140 transitions. [2019-11-28 02:58:49,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-11-28 02:58:49,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2019-11-28 02:58:49,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 140 transitions. [2019-11-28 02:58:49,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:49,703 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-11-28 02:58:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 140 transitions. [2019-11-28 02:58:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-11-28 02:58:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 02:58:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-11-28 02:58:49,718 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 02:58:49,718 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-11-28 02:58:49,718 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:58:49,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 126 transitions. [2019-11-28 02:58:49,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2019-11-28 02:58:49,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:49,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:49,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:49,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:49,722 INFO L794 eck$LassoCheckResult]: Stem: 1959#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 1960#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1988#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1985#L14-2 assume !(main_~i~0 == main_~range~0); 1983#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1980#L20-1 assume !(0 == main_~up~0); 1981#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 1989#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1986#L14 assume !(0 == main_~i~0); 1987#L14-2 [2019-11-28 02:58:49,722 INFO L796 eck$LassoCheckResult]: Loop: 1987#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2038#L17-1 assume !(1 == main_~up~0); 2036#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2035#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2034#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2022#L14 assume 0 == main_~i~0;main_~up~0 := 1; 1969#L14-2 assume !(main_~i~0 == main_~range~0); 1970#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2053#L20-1 assume !(0 == main_~up~0); 2051#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2021#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2020#L14 assume !(0 == main_~i~0); 1987#L14-2 [2019-11-28 02:58:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1817200562, now seen corresponding path program 2 times [2019-11-28 02:58:49,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815603354] [2019-11-28 02:58:49,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1139092067, now seen corresponding path program 2 times [2019-11-28 02:58:49,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584139018] [2019-11-28 02:58:49,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:49,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -140873580, now seen corresponding path program 1 times [2019-11-28 02:58:49,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546847708] [2019-11-28 02:58:49,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:58:49,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546847708] [2019-11-28 02:58:49,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428670355] [2019-11-28 02:58:49,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:49,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:49,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:58:49,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:49,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 02:58:49,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819105128] [2019-11-28 02:58:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:58:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:58:49,904 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-11-28 02:58:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:49,957 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-11-28 02:58:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:49,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 132 transitions. [2019-11-28 02:58:49,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2019-11-28 02:58:49,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 104 states and 120 transitions. [2019-11-28 02:58:49,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-11-28 02:58:49,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 02:58:49,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 120 transitions. [2019-11-28 02:58:49,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:49,962 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-11-28 02:58:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 120 transitions. [2019-11-28 02:58:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-28 02:58:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 02:58:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-11-28 02:58:49,966 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-11-28 02:58:49,966 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-11-28 02:58:49,966 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:58:49,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 110 transitions. [2019-11-28 02:58:49,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2019-11-28 02:58:49,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:49,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:49,968 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 02:58:49,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:49,969 INFO L794 eck$LassoCheckResult]: Stem: 2252#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2253#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2274#L14 assume !(0 == main_~i~0); 2296#L14-2 assume !(main_~i~0 == main_~range~0); 2295#L17-1 assume !(1 == main_~up~0); 2294#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2292#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2261#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2330#L14 assume !(0 == main_~i~0); 2329#L14-2 assume !(main_~i~0 == main_~range~0); 2326#L17-1 assume !(1 == main_~up~0); 2277#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2278#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 2319#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2315#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2316#L14-2 [2019-11-28 02:58:49,969 INFO L796 eck$LassoCheckResult]: Loop: 2316#L14-2 assume !(main_~i~0 == main_~range~0); 2341#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2339#L20-1 assume !(0 == main_~up~0); 2338#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2337#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2336#L14 assume !(0 == main_~i~0); 2334#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2333#L17-1 assume !(1 == main_~up~0); 2323#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2322#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2320#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2318#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2316#L14-2 [2019-11-28 02:58:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1377251387, now seen corresponding path program 2 times [2019-11-28 02:58:49,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:49,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440122471] [2019-11-28 02:58:49,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440122471] [2019-11-28 02:58:50,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878315616] [2019-11-28 02:58:50,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:50,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:50,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:50,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:50,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:50,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2019-11-28 02:58:50,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850640240] [2019-11-28 02:58:50,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2022702435, now seen corresponding path program 3 times [2019-11-28 02:58:50,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:50,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099956058] [2019-11-28 02:58:50,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:50,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:50,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:50,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:58:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:58:50,117 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. cyclomatic complexity: 22 Second operand 7 states. [2019-11-28 02:58:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:50,311 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2019-11-28 02:58:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:58:50,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 182 transitions. [2019-11-28 02:58:50,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-11-28 02:58:50,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 156 states and 180 transitions. [2019-11-28 02:58:50,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-11-28 02:58:50,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-28 02:58:50,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 180 transitions. [2019-11-28 02:58:50,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:50,316 INFO L688 BuchiCegarLoop]: Abstraction has 156 states and 180 transitions. [2019-11-28 02:58:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 180 transitions. [2019-11-28 02:58:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 106. [2019-11-28 02:58:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:58:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-11-28 02:58:50,320 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-11-28 02:58:50,320 INFO L591 BuchiCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-11-28 02:58:50,320 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:58:50,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 124 transitions. [2019-11-28 02:58:50,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2019-11-28 02:58:50,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:50,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:50,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:58:50,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2019-11-28 02:58:50,322 INFO L794 eck$LassoCheckResult]: Stem: 2568#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2569#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2594#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2592#L14-2 assume !(main_~i~0 == main_~range~0); 2589#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2590#L20-1 assume !(0 == main_~up~0); 2607#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2608#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2595#L14 assume !(0 == main_~i~0); 2593#L14-2 assume !(main_~i~0 == main_~range~0); 2591#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2587#L20-1 assume !(0 == main_~up~0); 2588#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2597#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2598#L14 assume !(0 == main_~i~0); 2663#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2662#L17-1 [2019-11-28 02:58:50,323 INFO L796 eck$LassoCheckResult]: Loop: 2662#L17-1 assume !(1 == main_~up~0); 2660#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2661#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2669#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2668#L14 assume !(0 == main_~i~0); 2667#L14-2 assume !(main_~i~0 == main_~range~0); 2664#L17-1 assume !(1 == main_~up~0); 2659#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2656#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2657#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2665#L14 assume !(0 == main_~i~0); 2666#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2662#L17-1 [2019-11-28 02:58:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1260517746, now seen corresponding path program 1 times [2019-11-28 02:58:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:50,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50664570] [2019-11-28 02:58:50,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50664570] [2019-11-28 02:58:50,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149195538] [2019-11-28 02:58:50,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:50,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:50,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:50,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 02:58:50,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601259917] [2019-11-28 02:58:50,439 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1690025817, now seen corresponding path program 1 times [2019-11-28 02:58:50,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:50,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143252860] [2019-11-28 02:58:50,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143252860] [2019-11-28 02:58:50,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:50,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:58:50,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340246750] [2019-11-28 02:58:50,466 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:50,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:58:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:58:50,466 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-28 02:58:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:50,504 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-11-28 02:58:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:58:50,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 137 transitions. [2019-11-28 02:58:50,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2019-11-28 02:58:50,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 137 transitions. [2019-11-28 02:58:50,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-11-28 02:58:50,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-11-28 02:58:50,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 137 transitions. [2019-11-28 02:58:50,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:50,510 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-11-28 02:58:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 137 transitions. [2019-11-28 02:58:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-28 02:58:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:58:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-11-28 02:58:50,512 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-11-28 02:58:50,512 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-11-28 02:58:50,512 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:58:50,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 107 transitions. [2019-11-28 02:58:50,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2019-11-28 02:58:50,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:50,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:50,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:58:50,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:58:50,514 INFO L794 eck$LassoCheckResult]: Stem: 2861#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 2862#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2871#L14 assume 0 == main_~i~0;main_~up~0 := 1; 2867#L14-2 assume !(main_~i~0 == main_~range~0); 2857#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2858#L20-1 assume !(0 == main_~up~0); 2870#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2941#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2892#L14 assume !(0 == main_~i~0); 2889#L14-2 assume !(main_~i~0 == main_~range~0); 2888#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2887#L20-1 assume !(0 == main_~up~0); 2885#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2886#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2940#L14 assume !(0 == main_~i~0); 2939#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 2938#L17-1 assume !(1 == main_~up~0); 2869#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2863#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2864#L26-1 [2019-11-28 02:58:50,514 INFO L796 eck$LassoCheckResult]: Loop: 2864#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2937#L14 assume !(0 == main_~i~0); 2935#L14-2 assume !(main_~i~0 == main_~range~0); 2927#L17-1 assume !(1 == main_~up~0); 2926#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 2925#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 2864#L26-1 [2019-11-28 02:58:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1185129105, now seen corresponding path program 2 times [2019-11-28 02:58:50,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:50,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839009597] [2019-11-28 02:58:50,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:50,551 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 02:58:50,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839009597] [2019-11-28 02:58:50,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782872625] [2019-11-28 02:58:50,551 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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) [2019-11-28 02:58:50,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:50,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:50,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:50,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:50,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:50,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-28 02:58:50,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156659709] [2019-11-28 02:58:50,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1188300564, now seen corresponding path program 2 times [2019-11-28 02:58:50,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:50,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280137358] [2019-11-28 02:58:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:50,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:50,676 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:50,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:50,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:50,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:50,677 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:50,677 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:50,677 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:50,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:50,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2019-11-28 02:58:50,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:50,678 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:50,679 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 02:58:50,681 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 02:58:50,683 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 02:58:50,686 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 02:58:50,782 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:50,782 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 02:58:50,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:50,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:50,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:50,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} 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 02:58:50,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:50,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:50,801 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:50,801 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:58:50,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:50,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:50,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:50,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:50,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:50,816 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 02:58:50,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:50,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:50,840 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:50,841 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:50,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:50,842 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:50,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:50,842 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:50,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:50,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:50,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:50,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2019-11-28 02:58:50,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:50,842 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:50,844 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 02:58:50,853 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 02:58:50,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 02:58:50,857 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 02:58:50,945 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:50,946 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:58:50,955 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 02:58:50,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:50,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:50,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:50,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:50,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:50,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:50,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:50,959 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 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 02:58:50,963 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 02:58:50,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:50,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:50,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:50,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:50,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:50,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:50,971 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:50,984 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 02:58:50,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:50,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:50,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:50,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:50,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:50,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:50,993 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:51,000 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 02:58:51,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:51,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:51,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:51,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:51,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:51,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:51,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:51,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:51,010 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:51,010 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:51,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:51,015 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:51,015 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:51,015 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 02:58:51,017 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,066 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 02:58:51,067 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 02:58:51,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-28 02:58:51,094 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 186 states and 218 transitions. Complement of second has 7 states. [2019-11-28 02:58:51,095 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 02:58:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 02:58:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 02:58:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:51,096 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,145 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 02:58:51,145 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 02:58:51,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-28 02:58:51,195 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 186 states and 218 transitions. Complement of second has 7 states. [2019-11-28 02:58:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:58:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 02:58:51,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 02:58:51,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:51,196 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,235 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 02:58:51,235 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 02:58:51,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-28 02:58:51,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 107 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 186 states and 221 transitions. Complement of second has 8 states. [2019-11-28 02:58:51,269 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 02:58:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-28 02:58:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 02:58:51,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 02:58:51,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:51,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 12 letters. [2019-11-28 02:58:51,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:51,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 221 transitions. [2019-11-28 02:58:51,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-28 02:58:51,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 127 states and 147 transitions. [2019-11-28 02:58:51,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 02:58:51,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 02:58:51,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 147 transitions. [2019-11-28 02:58:51,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:51,275 INFO L688 BuchiCegarLoop]: Abstraction has 127 states and 147 transitions. [2019-11-28 02:58:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 147 transitions. [2019-11-28 02:58:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 70. [2019-11-28 02:58:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 02:58:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-11-28 02:58:51,277 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-11-28 02:58:51,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:58:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:58:51,278 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 9 states. [2019-11-28 02:58:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:51,339 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-11-28 02:58:51,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:58:51,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 92 transitions. [2019-11-28 02:58:51,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:51,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 90 transitions. [2019-11-28 02:58:51,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 02:58:51,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:58:51,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 90 transitions. [2019-11-28 02:58:51,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:51,343 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-11-28 02:58:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 90 transitions. [2019-11-28 02:58:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-11-28 02:58:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:58:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-28 02:58:51,346 INFO L711 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-28 02:58:51,346 INFO L591 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-28 02:58:51,346 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:58:51,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2019-11-28 02:58:51,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:51,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:51,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:51,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1] [2019-11-28 02:58:51,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:51,349 INFO L794 eck$LassoCheckResult]: Stem: 3991#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 3992#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4062#L14 assume !(0 == main_~i~0); 4061#L14-2 assume !(main_~i~0 == main_~range~0); 4021#L17-1 assume !(1 == main_~up~0); 4019#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4015#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4016#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4049#L14 assume !(0 == main_~i~0); 4048#L14-2 assume !(main_~i~0 == main_~range~0); 4047#L17-1 assume !(1 == main_~up~0); 4046#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4041#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4031#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4040#L14 assume !(0 == main_~i~0); 4039#L14-2 assume !(main_~i~0 == main_~range~0); 4037#L17-1 assume !(1 == main_~up~0); 4035#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4030#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4029#L26-1 [2019-11-28 02:58:51,350 INFO L796 eck$LassoCheckResult]: Loop: 4029#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4026#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4027#L14-2 assume !(main_~i~0 == main_~range~0); 4009#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4010#L20-1 assume !(0 == main_~up~0); 3993#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 3994#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4038#L14 assume !(0 == main_~i~0); 4036#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4034#L17-1 assume !(1 == main_~up~0); 4033#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4032#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4029#L26-1 [2019-11-28 02:58:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1404305365, now seen corresponding path program 1 times [2019-11-28 02:58:51,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:51,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240276666] [2019-11-28 02:58:51,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:58:51,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240276666] [2019-11-28 02:58:51,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:58:51,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:58:51,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032210743] [2019-11-28 02:58:51,397 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:58:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 4 times [2019-11-28 02:58:51,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:51,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056968691] [2019-11-28 02:58:51,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,405 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:51,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:58:51,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:58:51,447 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-11-28 02:58:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:51,496 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-28 02:58:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:58:51,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 124 transitions. [2019-11-28 02:58:51,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:51,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 97 states and 107 transitions. [2019-11-28 02:58:51,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:51,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:51,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 107 transitions. [2019-11-28 02:58:51,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:51,500 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-28 02:58:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 107 transitions. [2019-11-28 02:58:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-11-28 02:58:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:58:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-11-28 02:58:51,503 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-11-28 02:58:51,503 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-11-28 02:58:51,503 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 02:58:51,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 106 transitions. [2019-11-28 02:58:51,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:51,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:51,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:51,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1] [2019-11-28 02:58:51,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:51,505 INFO L794 eck$LassoCheckResult]: Stem: 4187#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4188#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4226#L14 assume !(0 == main_~i~0); 4265#L14-2 assume !(main_~i~0 == main_~range~0); 4263#L17-1 assume !(1 == main_~up~0); 4261#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4260#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4258#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4257#L14 assume !(0 == main_~i~0); 4255#L14-2 assume !(main_~i~0 == main_~range~0); 4254#L17-1 assume !(1 == main_~up~0); 4253#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4250#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4233#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4246#L14 assume !(0 == main_~i~0); 4243#L14-2 assume !(main_~i~0 == main_~range~0); 4240#L17-1 assume !(1 == main_~up~0); 4237#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4232#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4230#L26-1 [2019-11-28 02:58:51,505 INFO L796 eck$LassoCheckResult]: Loop: 4230#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4231#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4205#L14-2 assume !(main_~i~0 == main_~range~0); 4201#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4202#L20-1 assume !(0 == main_~up~0); 4252#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4249#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4247#L14 assume !(0 == main_~i~0); 4244#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4241#L17-1 assume !(1 == main_~up~0); 4238#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4234#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4230#L26-1 [2019-11-28 02:58:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash -370701997, now seen corresponding path program 1 times [2019-11-28 02:58:51,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:51,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127884369] [2019-11-28 02:58:51,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 5 times [2019-11-28 02:58:51,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:51,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865817169] [2019-11-28 02:58:51,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:51,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1599701067, now seen corresponding path program 1 times [2019-11-28 02:58:51,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:51,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081400261] [2019-11-28 02:58:51,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:51,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081400261] [2019-11-28 02:58:51,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213988332] [2019-11-28 02:58:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:51,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:51,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:51,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:51,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-11-28 02:58:51,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318588837] [2019-11-28 02:58:51,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:58:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:58:51,753 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. cyclomatic complexity: 14 Second operand 10 states. [2019-11-28 02:58:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:52,044 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-11-28 02:58:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:58:52,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 127 transitions. [2019-11-28 02:58:52,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 113 states and 123 transitions. [2019-11-28 02:58:52,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:52,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:52,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 123 transitions. [2019-11-28 02:58:52,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:52,051 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-11-28 02:58:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 123 transitions. [2019-11-28 02:58:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2019-11-28 02:58:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:58:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-11-28 02:58:52,053 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-28 02:58:52,053 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-28 02:58:52,054 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 02:58:52,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 112 transitions. [2019-11-28 02:58:52,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:52,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:52,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 1] [2019-11-28 02:58:52,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:52,056 INFO L794 eck$LassoCheckResult]: Stem: 4521#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4522#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4567#L14 assume !(0 == main_~i~0); 4603#L14-2 assume !(main_~i~0 == main_~range~0); 4618#L17-1 assume !(1 == main_~up~0); 4622#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4620#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4530#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4615#L14 assume !(0 == main_~i~0); 4614#L14-2 assume !(main_~i~0 == main_~range~0); 4613#L17-1 assume !(1 == main_~up~0); 4612#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4611#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4610#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4609#L14 assume !(0 == main_~i~0); 4608#L14-2 assume !(main_~i~0 == main_~range~0); 4607#L17-1 assume !(1 == main_~up~0); 4606#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4605#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4575#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4602#L14 assume !(0 == main_~i~0); 4600#L14-2 assume !(main_~i~0 == main_~range~0); 4598#L17-1 assume !(1 == main_~up~0); 4579#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4574#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4571#L26-1 [2019-11-28 02:58:52,056 INFO L796 eck$LassoCheckResult]: Loop: 4571#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4572#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4573#L14-2 assume !(main_~i~0 == main_~range~0); 4543#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4534#L20-1 assume !(0 == main_~up~0); 4535#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4588#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4586#L14 assume !(0 == main_~i~0); 4584#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4582#L17-1 assume !(1 == main_~up~0); 4580#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4576#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4571#L26-1 [2019-11-28 02:58:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash 250596068, now seen corresponding path program 2 times [2019-11-28 02:58:52,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193537071] [2019-11-28 02:58:52,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 6 times [2019-11-28 02:58:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557555598] [2019-11-28 02:58:52,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash -695472186, now seen corresponding path program 2 times [2019-11-28 02:58:52,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799783307] [2019-11-28 02:58:52,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:52,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799783307] [2019-11-28 02:58:52,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95149519] [2019-11-28 02:58:52,159 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:52,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:52,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:52,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:58:52,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:52,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:52,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 02:58:52,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156021636] [2019-11-28 02:58:52,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:52,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:58:52,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:58:52,263 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. cyclomatic complexity: 14 Second operand 11 states. [2019-11-28 02:58:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:52,536 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-28 02:58:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:58:52,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 131 transitions. [2019-11-28 02:58:52,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 119 states and 129 transitions. [2019-11-28 02:58:52,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:52,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:52,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 129 transitions. [2019-11-28 02:58:52,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:52,540 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 129 transitions. [2019-11-28 02:58:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 129 transitions. [2019-11-28 02:58:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-11-28 02:58:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 02:58:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-28 02:58:52,543 INFO L711 BuchiCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-28 02:58:52,543 INFO L591 BuchiCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-28 02:58:52,543 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 02:58:52,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 118 transitions. [2019-11-28 02:58:52,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:52,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:52,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1] [2019-11-28 02:58:52,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:52,545 INFO L794 eck$LassoCheckResult]: Stem: 4892#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 4893#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4934#L14 assume !(0 == main_~i~0); 4970#L14-2 assume !(main_~i~0 == main_~range~0); 4991#L17-1 assume !(1 == main_~up~0); 4995#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4993#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4897#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4988#L14 assume !(0 == main_~i~0); 4987#L14-2 assume !(main_~i~0 == main_~range~0); 4986#L17-1 assume !(1 == main_~up~0); 4985#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4984#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4983#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4982#L14 assume !(0 == main_~i~0); 4981#L14-2 assume !(main_~i~0 == main_~range~0); 4980#L17-1 assume !(1 == main_~up~0); 4979#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4978#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4977#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4976#L14 assume !(0 == main_~i~0); 4975#L14-2 assume !(main_~i~0 == main_~range~0); 4974#L17-1 assume !(1 == main_~up~0); 4973#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4972#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4942#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4969#L14 assume !(0 == main_~i~0); 4967#L14-2 assume !(main_~i~0 == main_~range~0); 4965#L17-1 assume !(1 == main_~up~0); 4946#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4941#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 4938#L26-1 [2019-11-28 02:58:52,545 INFO L796 eck$LassoCheckResult]: Loop: 4938#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4939#L14 assume 0 == main_~i~0;main_~up~0 := 1; 4940#L14-2 assume !(main_~i~0 == main_~range~0); 4910#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4901#L20-1 assume !(0 == main_~up~0); 4902#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4955#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4953#L14 assume !(0 == main_~i~0); 4951#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 4949#L17-1 assume !(1 == main_~up~0); 4947#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 4943#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 4938#L26-1 [2019-11-28 02:58:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1184179275, now seen corresponding path program 3 times [2019-11-28 02:58:52,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459595773] [2019-11-28 02:58:52,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 7 times [2019-11-28 02:58:52,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800761328] [2019-11-28 02:58:52,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1981329641, now seen corresponding path program 3 times [2019-11-28 02:58:52,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252252520] [2019-11-28 02:58:52,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:52,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252252520] [2019-11-28 02:58:52,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323374978] [2019-11-28 02:58:52,682 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:52,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 02:58:52,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:52,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:58:52,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:52,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:52,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-28 02:58:52,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753160497] [2019-11-28 02:58:52,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:52,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:58:52,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:58:52,766 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. cyclomatic complexity: 14 Second operand 11 states. [2019-11-28 02:58:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:52,973 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2019-11-28 02:58:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:58:52,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 137 transitions. [2019-11-28 02:58:52,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 125 states and 135 transitions. [2019-11-28 02:58:52,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:52,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:52,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 135 transitions. [2019-11-28 02:58:52,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:52,978 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2019-11-28 02:58:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 135 transitions. [2019-11-28 02:58:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2019-11-28 02:58:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 02:58:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-28 02:58:52,981 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-28 02:58:52,981 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-28 02:58:52,981 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 02:58:52,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 124 transitions. [2019-11-28 02:58:52,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:52,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:52,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:52,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 1] [2019-11-28 02:58:52,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:52,984 INFO L794 eck$LassoCheckResult]: Stem: 5279#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5280#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5325#L14 assume !(0 == main_~i~0); 5361#L14-2 assume !(main_~i~0 == main_~range~0); 5388#L17-1 assume !(1 == main_~up~0); 5392#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5390#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5288#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5385#L14 assume !(0 == main_~i~0); 5384#L14-2 assume !(main_~i~0 == main_~range~0); 5383#L17-1 assume !(1 == main_~up~0); 5382#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5381#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5380#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5379#L14 assume !(0 == main_~i~0); 5378#L14-2 assume !(main_~i~0 == main_~range~0); 5377#L17-1 assume !(1 == main_~up~0); 5376#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5375#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5374#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5373#L14 assume !(0 == main_~i~0); 5372#L14-2 assume !(main_~i~0 == main_~range~0); 5371#L17-1 assume !(1 == main_~up~0); 5370#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5369#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5368#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5367#L14 assume !(0 == main_~i~0); 5366#L14-2 assume !(main_~i~0 == main_~range~0); 5365#L17-1 assume !(1 == main_~up~0); 5364#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5363#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5333#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5360#L14 assume !(0 == main_~i~0); 5358#L14-2 assume !(main_~i~0 == main_~range~0); 5356#L17-1 assume !(1 == main_~up~0); 5337#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5332#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5329#L26-1 [2019-11-28 02:58:52,984 INFO L796 eck$LassoCheckResult]: Loop: 5329#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5330#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5331#L14-2 assume !(main_~i~0 == main_~range~0); 5301#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5292#L20-1 assume !(0 == main_~up~0); 5293#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5346#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5344#L14 assume !(0 == main_~i~0); 5342#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5340#L17-1 assume !(1 == main_~up~0); 5338#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5334#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5329#L26-1 [2019-11-28 02:58:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash -279950394, now seen corresponding path program 4 times [2019-11-28 02:58:52,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:52,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179076366] [2019-11-28 02:58:52,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:53,001 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 8 times [2019-11-28 02:58:53,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:53,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738238630] [2019-11-28 02:58:53,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash 970468776, now seen corresponding path program 4 times [2019-11-28 02:58:53,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:53,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686668763] [2019-11-28 02:58:53,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 62 proven. 102 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:53,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686668763] [2019-11-28 02:58:53,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123894074] [2019-11-28 02:58:53,144 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:53,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:58:53,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:53,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:58:53,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 62 proven. 102 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:53,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:53,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-11-28 02:58:53,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005473318] [2019-11-28 02:58:53,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:58:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:58:53,249 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. cyclomatic complexity: 14 Second operand 13 states. [2019-11-28 02:58:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:53,527 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2019-11-28 02:58:53,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:58:53,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 143 transitions. [2019-11-28 02:58:53,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:53,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 131 states and 141 transitions. [2019-11-28 02:58:53,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:53,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:53,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 141 transitions. [2019-11-28 02:58:53,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:53,531 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 141 transitions. [2019-11-28 02:58:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 141 transitions. [2019-11-28 02:58:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2019-11-28 02:58:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:58:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2019-11-28 02:58:53,534 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-11-28 02:58:53,534 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-11-28 02:58:53,534 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-28 02:58:53,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 130 transitions. [2019-11-28 02:58:53,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:53,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:53,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:53,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 7, 1] [2019-11-28 02:58:53,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:53,536 INFO L794 eck$LassoCheckResult]: Stem: 5712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 5713#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5754#L14 assume !(0 == main_~i~0); 5790#L14-2 assume !(main_~i~0 == main_~range~0); 5823#L17-1 assume !(1 == main_~up~0); 5827#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5825#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5717#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5820#L14 assume !(0 == main_~i~0); 5819#L14-2 assume !(main_~i~0 == main_~range~0); 5818#L17-1 assume !(1 == main_~up~0); 5817#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5816#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5815#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5814#L14 assume !(0 == main_~i~0); 5813#L14-2 assume !(main_~i~0 == main_~range~0); 5812#L17-1 assume !(1 == main_~up~0); 5811#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5810#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5809#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5808#L14 assume !(0 == main_~i~0); 5807#L14-2 assume !(main_~i~0 == main_~range~0); 5806#L17-1 assume !(1 == main_~up~0); 5805#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5804#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5803#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5802#L14 assume !(0 == main_~i~0); 5801#L14-2 assume !(main_~i~0 == main_~range~0); 5800#L17-1 assume !(1 == main_~up~0); 5799#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5798#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5797#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5796#L14 assume !(0 == main_~i~0); 5795#L14-2 assume !(main_~i~0 == main_~range~0); 5794#L17-1 assume !(1 == main_~up~0); 5793#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5792#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5762#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5789#L14 assume !(0 == main_~i~0); 5787#L14-2 assume !(main_~i~0 == main_~range~0); 5785#L17-1 assume !(1 == main_~up~0); 5766#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5761#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 5758#L26-1 [2019-11-28 02:58:53,536 INFO L796 eck$LassoCheckResult]: Loop: 5758#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5759#L14 assume 0 == main_~i~0;main_~up~0 := 1; 5760#L14-2 assume !(main_~i~0 == main_~range~0); 5730#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5721#L20-1 assume !(0 == main_~up~0); 5722#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5775#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5773#L14 assume !(0 == main_~i~0); 5771#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 5769#L17-1 assume !(1 == main_~up~0); 5767#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 5763#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 5758#L26-1 [2019-11-28 02:58:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1565807849, now seen corresponding path program 5 times [2019-11-28 02:58:53,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:53,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240296489] [2019-11-28 02:58:53,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 9 times [2019-11-28 02:58:53,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:53,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128728657] [2019-11-28 02:58:53,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:53,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -745399431, now seen corresponding path program 5 times [2019-11-28 02:58:53,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:53,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556003805] [2019-11-28 02:58:53,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:53,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556003805] [2019-11-28 02:58:53,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426733755] [2019-11-28 02:58:53,672 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:53,704 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 02:58:53,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:53,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:58:53,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:53,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:53,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 13 [2019-11-28 02:58:53,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210833013] [2019-11-28 02:58:53,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:58:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:58:53,779 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-11-28 02:58:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:54,052 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-11-28 02:58:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 02:58:54,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 149 transitions. [2019-11-28 02:58:54,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:54,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 137 states and 147 transitions. [2019-11-28 02:58:54,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:54,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:54,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 147 transitions. [2019-11-28 02:58:54,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:54,056 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2019-11-28 02:58:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 147 transitions. [2019-11-28 02:58:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2019-11-28 02:58:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 02:58:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-11-28 02:58:54,059 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-11-28 02:58:54,059 INFO L591 BuchiCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-11-28 02:58:54,060 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-28 02:58:54,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 136 transitions. [2019-11-28 02:58:54,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:54,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:54,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:54,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 1] [2019-11-28 02:58:54,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:54,062 INFO L794 eck$LassoCheckResult]: Stem: 6172#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6173#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6214#L14 assume !(0 == main_~i~0); 6250#L14-2 assume !(main_~i~0 == main_~range~0); 6289#L17-1 assume !(1 == main_~up~0); 6293#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6291#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6177#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6286#L14 assume !(0 == main_~i~0); 6285#L14-2 assume !(main_~i~0 == main_~range~0); 6284#L17-1 assume !(1 == main_~up~0); 6283#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6282#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6281#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6280#L14 assume !(0 == main_~i~0); 6279#L14-2 assume !(main_~i~0 == main_~range~0); 6278#L17-1 assume !(1 == main_~up~0); 6277#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6276#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6275#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6274#L14 assume !(0 == main_~i~0); 6273#L14-2 assume !(main_~i~0 == main_~range~0); 6272#L17-1 assume !(1 == main_~up~0); 6271#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6270#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6269#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6268#L14 assume !(0 == main_~i~0); 6267#L14-2 assume !(main_~i~0 == main_~range~0); 6266#L17-1 assume !(1 == main_~up~0); 6265#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6264#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6263#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6262#L14 assume !(0 == main_~i~0); 6261#L14-2 assume !(main_~i~0 == main_~range~0); 6260#L17-1 assume !(1 == main_~up~0); 6259#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6258#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6257#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6256#L14 assume !(0 == main_~i~0); 6255#L14-2 assume !(main_~i~0 == main_~range~0); 6254#L17-1 assume !(1 == main_~up~0); 6253#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6252#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6222#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6249#L14 assume !(0 == main_~i~0); 6247#L14-2 assume !(main_~i~0 == main_~range~0); 6245#L17-1 assume !(1 == main_~up~0); 6226#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6221#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6218#L26-1 [2019-11-28 02:58:54,062 INFO L796 eck$LassoCheckResult]: Loop: 6218#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6219#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6220#L14-2 assume !(main_~i~0 == main_~range~0); 6190#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6181#L20-1 assume !(0 == main_~up~0); 6182#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6235#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6233#L14 assume !(0 == main_~i~0); 6231#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6229#L17-1 assume !(1 == main_~up~0); 6227#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6223#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6218#L26-1 [2019-11-28 02:58:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1385990568, now seen corresponding path program 6 times [2019-11-28 02:58:54,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528463652] [2019-11-28 02:58:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 10 times [2019-11-28 02:58:54,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452952517] [2019-11-28 02:58:54,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash -748902262, now seen corresponding path program 6 times [2019-11-28 02:58:54,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891698627] [2019-11-28 02:58:54,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 82 proven. 184 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:54,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891698627] [2019-11-28 02:58:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252733762] [2019-11-28 02:58:54,257 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:54,304 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-28 02:58:54,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:54,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:58:54,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 82 proven. 184 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:54,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:54,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2019-11-28 02:58:54,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281381707] [2019-11-28 02:58:54,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:54,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:58:54,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:58:54,384 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. cyclomatic complexity: 14 Second operand 15 states. [2019-11-28 02:58:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:54,677 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2019-11-28 02:58:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 02:58:54,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 155 transitions. [2019-11-28 02:58:54,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:54,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 143 states and 153 transitions. [2019-11-28 02:58:54,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:54,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:54,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 153 transitions. [2019-11-28 02:58:54,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:54,681 INFO L688 BuchiCegarLoop]: Abstraction has 143 states and 153 transitions. [2019-11-28 02:58:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 153 transitions. [2019-11-28 02:58:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2019-11-28 02:58:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:58:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2019-11-28 02:58:54,684 INFO L711 BuchiCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-11-28 02:58:54,684 INFO L591 BuchiCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-11-28 02:58:54,684 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-28 02:58:54,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 142 transitions. [2019-11-28 02:58:54,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:54,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:54,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:54,686 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 9, 1] [2019-11-28 02:58:54,686 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:54,687 INFO L794 eck$LassoCheckResult]: Stem: 6663#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 6664#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6705#L14 assume !(0 == main_~i~0); 6743#L14-2 assume !(main_~i~0 == main_~range~0); 6738#L17-1 assume !(1 == main_~up~0); 6735#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6736#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6668#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6785#L14 assume !(0 == main_~i~0); 6784#L14-2 assume !(main_~i~0 == main_~range~0); 6783#L17-1 assume !(1 == main_~up~0); 6782#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6781#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6780#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6779#L14 assume !(0 == main_~i~0); 6778#L14-2 assume !(main_~i~0 == main_~range~0); 6777#L17-1 assume !(1 == main_~up~0); 6776#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6775#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6774#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6773#L14 assume !(0 == main_~i~0); 6772#L14-2 assume !(main_~i~0 == main_~range~0); 6771#L17-1 assume !(1 == main_~up~0); 6770#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6769#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6768#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6767#L14 assume !(0 == main_~i~0); 6766#L14-2 assume !(main_~i~0 == main_~range~0); 6765#L17-1 assume !(1 == main_~up~0); 6764#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6763#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6762#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6761#L14 assume !(0 == main_~i~0); 6760#L14-2 assume !(main_~i~0 == main_~range~0); 6759#L17-1 assume !(1 == main_~up~0); 6758#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6757#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6756#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6755#L14 assume !(0 == main_~i~0); 6754#L14-2 assume !(main_~i~0 == main_~range~0); 6753#L17-1 assume !(1 == main_~up~0); 6752#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6751#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6750#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6749#L14 assume !(0 == main_~i~0); 6748#L14-2 assume !(main_~i~0 == main_~range~0); 6747#L17-1 assume !(1 == main_~up~0); 6746#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6745#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6713#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6742#L14 assume !(0 == main_~i~0); 6739#L14-2 assume !(main_~i~0 == main_~range~0); 6737#L17-1 assume !(1 == main_~up~0); 6717#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6712#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 6709#L26-1 [2019-11-28 02:58:54,687 INFO L796 eck$LassoCheckResult]: Loop: 6709#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6710#L14 assume 0 == main_~i~0;main_~up~0 := 1; 6711#L14-2 assume !(main_~i~0 == main_~range~0); 6681#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6673#L20-1 assume !(0 == main_~up~0); 6674#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6726#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6724#L14 assume !(0 == main_~i~0); 6722#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 6720#L17-1 assume !(1 == main_~up~0); 6718#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 6714#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 6709#L26-1 [2019-11-28 02:58:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash -329877639, now seen corresponding path program 7 times [2019-11-28 02:58:54,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628999757] [2019-11-28 02:58:54,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 11 times [2019-11-28 02:58:54,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692664526] [2019-11-28 02:58:54,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:54,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1517067045, now seen corresponding path program 7 times [2019-11-28 02:58:54,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:54,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568304055] [2019-11-28 02:58:54,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 92 proven. 234 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:54,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568304055] [2019-11-28 02:58:54,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474554077] [2019-11-28 02:58:54,862 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:54,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:58:54,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 92 proven. 234 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:54,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:54,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2019-11-28 02:58:54,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686589650] [2019-11-28 02:58:54,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 02:58:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:58:54,977 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. cyclomatic complexity: 14 Second operand 16 states. [2019-11-28 02:58:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:55,265 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2019-11-28 02:58:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 02:58:55,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 161 transitions. [2019-11-28 02:58:55,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:55,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 149 states and 159 transitions. [2019-11-28 02:58:55,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:55,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:55,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 159 transitions. [2019-11-28 02:58:55,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:55,270 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 159 transitions. [2019-11-28 02:58:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 159 transitions. [2019-11-28 02:58:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2019-11-28 02:58:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 02:58:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2019-11-28 02:58:55,273 INFO L711 BuchiCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-11-28 02:58:55,273 INFO L591 BuchiCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-11-28 02:58:55,273 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-28 02:58:55,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 148 transitions. [2019-11-28 02:58:55,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:55,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:55,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:55,275 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1] [2019-11-28 02:58:55,275 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:55,275 INFO L794 eck$LassoCheckResult]: Stem: 7185#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7186#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7227#L14 assume !(0 == main_~i~0); 7263#L14-2 assume !(main_~i~0 == main_~range~0); 7314#L17-1 assume !(1 == main_~up~0); 7318#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7316#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7190#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7311#L14 assume !(0 == main_~i~0); 7310#L14-2 assume !(main_~i~0 == main_~range~0); 7309#L17-1 assume !(1 == main_~up~0); 7308#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7307#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7306#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7305#L14 assume !(0 == main_~i~0); 7304#L14-2 assume !(main_~i~0 == main_~range~0); 7303#L17-1 assume !(1 == main_~up~0); 7302#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7301#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7300#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7299#L14 assume !(0 == main_~i~0); 7298#L14-2 assume !(main_~i~0 == main_~range~0); 7297#L17-1 assume !(1 == main_~up~0); 7296#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7295#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7294#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7293#L14 assume !(0 == main_~i~0); 7292#L14-2 assume !(main_~i~0 == main_~range~0); 7291#L17-1 assume !(1 == main_~up~0); 7290#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7289#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7288#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7287#L14 assume !(0 == main_~i~0); 7286#L14-2 assume !(main_~i~0 == main_~range~0); 7285#L17-1 assume !(1 == main_~up~0); 7284#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7283#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7282#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7281#L14 assume !(0 == main_~i~0); 7280#L14-2 assume !(main_~i~0 == main_~range~0); 7279#L17-1 assume !(1 == main_~up~0); 7278#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7277#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7276#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7275#L14 assume !(0 == main_~i~0); 7274#L14-2 assume !(main_~i~0 == main_~range~0); 7273#L17-1 assume !(1 == main_~up~0); 7272#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7271#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7270#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7269#L14 assume !(0 == main_~i~0); 7268#L14-2 assume !(main_~i~0 == main_~range~0); 7267#L17-1 assume !(1 == main_~up~0); 7266#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7265#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7235#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7262#L14 assume !(0 == main_~i~0); 7260#L14-2 assume !(main_~i~0 == main_~range~0); 7258#L17-1 assume !(1 == main_~up~0); 7239#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7234#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7231#L26-1 [2019-11-28 02:58:55,275 INFO L796 eck$LassoCheckResult]: Loop: 7231#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7232#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7233#L14-2 assume !(main_~i~0 == main_~range~0); 7203#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7194#L20-1 assume !(0 == main_~up~0); 7195#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7248#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7246#L14 assume !(0 == main_~i~0); 7244#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7242#L17-1 assume !(1 == main_~up~0); 7240#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7236#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7231#L26-1 [2019-11-28 02:58:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash -333380470, now seen corresponding path program 8 times [2019-11-28 02:58:55,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:55,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469435279] [2019-11-28 02:58:55,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:55,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 12 times [2019-11-28 02:58:55,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:55,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121426964] [2019-11-28 02:58:55,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:55,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1202053228, now seen corresponding path program 8 times [2019-11-28 02:58:55,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:55,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282070885] [2019-11-28 02:58:55,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 102 proven. 290 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:55,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282070885] [2019-11-28 02:58:55,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250510775] [2019-11-28 02:58:55,498 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:55,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:55,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:55,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:58:55,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 102 proven. 290 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:55,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:55,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 16 [2019-11-28 02:58:55,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654661931] [2019-11-28 02:58:55,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:58:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:58:55,671 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. cyclomatic complexity: 14 Second operand 17 states. [2019-11-28 02:58:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:56,009 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-28 02:58:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 02:58:56,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 167 transitions. [2019-11-28 02:58:56,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:56,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 155 states and 165 transitions. [2019-11-28 02:58:56,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:56,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:56,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 165 transitions. [2019-11-28 02:58:56,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:56,013 INFO L688 BuchiCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-11-28 02:58:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 165 transitions. [2019-11-28 02:58:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2019-11-28 02:58:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 02:58:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2019-11-28 02:58:56,017 INFO L711 BuchiCegarLoop]: Abstraction has 144 states and 154 transitions. [2019-11-28 02:58:56,017 INFO L591 BuchiCegarLoop]: Abstraction has 144 states and 154 transitions. [2019-11-28 02:58:56,018 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-28 02:58:56,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 154 transitions. [2019-11-28 02:58:56,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:56,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:56,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:56,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 11, 1] [2019-11-28 02:58:56,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:56,021 INFO L794 eck$LassoCheckResult]: Stem: 7738#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 7739#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7780#L14 assume !(0 == main_~i~0); 7816#L14-2 assume !(main_~i~0 == main_~range~0); 7873#L17-1 assume !(1 == main_~up~0); 7877#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7875#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7743#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7870#L14 assume !(0 == main_~i~0); 7869#L14-2 assume !(main_~i~0 == main_~range~0); 7868#L17-1 assume !(1 == main_~up~0); 7867#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7866#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7865#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7864#L14 assume !(0 == main_~i~0); 7863#L14-2 assume !(main_~i~0 == main_~range~0); 7862#L17-1 assume !(1 == main_~up~0); 7861#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7860#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7859#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7858#L14 assume !(0 == main_~i~0); 7857#L14-2 assume !(main_~i~0 == main_~range~0); 7856#L17-1 assume !(1 == main_~up~0); 7855#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7854#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7853#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7852#L14 assume !(0 == main_~i~0); 7851#L14-2 assume !(main_~i~0 == main_~range~0); 7850#L17-1 assume !(1 == main_~up~0); 7849#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7848#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7847#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7846#L14 assume !(0 == main_~i~0); 7845#L14-2 assume !(main_~i~0 == main_~range~0); 7844#L17-1 assume !(1 == main_~up~0); 7843#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7842#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7841#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7840#L14 assume !(0 == main_~i~0); 7839#L14-2 assume !(main_~i~0 == main_~range~0); 7838#L17-1 assume !(1 == main_~up~0); 7837#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7836#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7835#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7834#L14 assume !(0 == main_~i~0); 7833#L14-2 assume !(main_~i~0 == main_~range~0); 7832#L17-1 assume !(1 == main_~up~0); 7831#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7830#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7829#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7828#L14 assume !(0 == main_~i~0); 7827#L14-2 assume !(main_~i~0 == main_~range~0); 7826#L17-1 assume !(1 == main_~up~0); 7825#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7824#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7823#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7822#L14 assume !(0 == main_~i~0); 7821#L14-2 assume !(main_~i~0 == main_~range~0); 7820#L17-1 assume !(1 == main_~up~0); 7819#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7818#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7788#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7815#L14 assume !(0 == main_~i~0); 7813#L14-2 assume !(main_~i~0 == main_~range~0); 7811#L17-1 assume !(1 == main_~up~0); 7792#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7787#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 7784#L26-1 [2019-11-28 02:58:56,021 INFO L796 eck$LassoCheckResult]: Loop: 7784#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7785#L14 assume 0 == main_~i~0;main_~up~0 := 1; 7786#L14-2 assume !(main_~i~0 == main_~range~0); 7756#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7747#L20-1 assume !(0 == main_~up~0); 7748#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7801#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7799#L14 assume !(0 == main_~i~0); 7797#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 7795#L17-1 assume !(1 == main_~up~0); 7793#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 7789#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 7784#L26-1 [2019-11-28 02:58:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1101545253, now seen corresponding path program 9 times [2019-11-28 02:58:56,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475556470] [2019-11-28 02:58:56,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 13 times [2019-11-28 02:58:56,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527590630] [2019-11-28 02:58:56,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash 689417021, now seen corresponding path program 9 times [2019-11-28 02:58:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630528153] [2019-11-28 02:58:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 112 proven. 352 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:56,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630528153] [2019-11-28 02:58:56,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162711490] [2019-11-28 02:58:56,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:56,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-28 02:58:56,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:56,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:58:56,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 112 proven. 352 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:56,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:56,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2019-11-28 02:58:56,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94477308] [2019-11-28 02:58:56,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 02:58:56,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:58:56,378 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. cyclomatic complexity: 14 Second operand 18 states. [2019-11-28 02:58:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:56,731 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2019-11-28 02:58:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 02:58:56,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 173 transitions. [2019-11-28 02:58:56,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:56,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 161 states and 171 transitions. [2019-11-28 02:58:56,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:56,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:56,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 171 transitions. [2019-11-28 02:58:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:56,737 INFO L688 BuchiCegarLoop]: Abstraction has 161 states and 171 transitions. [2019-11-28 02:58:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 171 transitions. [2019-11-28 02:58:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 150. [2019-11-28 02:58:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 02:58:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2019-11-28 02:58:56,740 INFO L711 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2019-11-28 02:58:56,741 INFO L591 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2019-11-28 02:58:56,741 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-28 02:58:56,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 160 transitions. [2019-11-28 02:58:56,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:56,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:56,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:56,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 12, 1] [2019-11-28 02:58:56,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:56,752 INFO L794 eck$LassoCheckResult]: Stem: 8322#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8323#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8364#L14 assume !(0 == main_~i~0); 8400#L14-2 assume !(main_~i~0 == main_~range~0); 8463#L17-1 assume !(1 == main_~up~0); 8467#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8465#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8327#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8460#L14 assume !(0 == main_~i~0); 8459#L14-2 assume !(main_~i~0 == main_~range~0); 8458#L17-1 assume !(1 == main_~up~0); 8457#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8456#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8455#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8454#L14 assume !(0 == main_~i~0); 8453#L14-2 assume !(main_~i~0 == main_~range~0); 8452#L17-1 assume !(1 == main_~up~0); 8451#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8450#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8449#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8448#L14 assume !(0 == main_~i~0); 8447#L14-2 assume !(main_~i~0 == main_~range~0); 8446#L17-1 assume !(1 == main_~up~0); 8445#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8444#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8443#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8442#L14 assume !(0 == main_~i~0); 8441#L14-2 assume !(main_~i~0 == main_~range~0); 8440#L17-1 assume !(1 == main_~up~0); 8439#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8438#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8437#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8436#L14 assume !(0 == main_~i~0); 8435#L14-2 assume !(main_~i~0 == main_~range~0); 8434#L17-1 assume !(1 == main_~up~0); 8433#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8432#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8431#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8430#L14 assume !(0 == main_~i~0); 8429#L14-2 assume !(main_~i~0 == main_~range~0); 8428#L17-1 assume !(1 == main_~up~0); 8427#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8426#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8425#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8424#L14 assume !(0 == main_~i~0); 8423#L14-2 assume !(main_~i~0 == main_~range~0); 8422#L17-1 assume !(1 == main_~up~0); 8421#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8420#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8419#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8418#L14 assume !(0 == main_~i~0); 8417#L14-2 assume !(main_~i~0 == main_~range~0); 8416#L17-1 assume !(1 == main_~up~0); 8415#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8414#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8413#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8412#L14 assume !(0 == main_~i~0); 8411#L14-2 assume !(main_~i~0 == main_~range~0); 8410#L17-1 assume !(1 == main_~up~0); 8409#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8408#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8407#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8406#L14 assume !(0 == main_~i~0); 8405#L14-2 assume !(main_~i~0 == main_~range~0); 8404#L17-1 assume !(1 == main_~up~0); 8403#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8402#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8372#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8399#L14 assume !(0 == main_~i~0); 8397#L14-2 assume !(main_~i~0 == main_~range~0); 8395#L17-1 assume !(1 == main_~up~0); 8376#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8371#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8368#L26-1 [2019-11-28 02:58:56,752 INFO L796 eck$LassoCheckResult]: Loop: 8368#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8369#L14 assume 0 == main_~i~0;main_~up~0 := 1; 8370#L14-2 assume !(main_~i~0 == main_~range~0); 8340#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8331#L20-1 assume !(0 == main_~up~0); 8332#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8385#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8383#L14 assume !(0 == main_~i~0); 8381#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 8379#L17-1 assume !(1 == main_~up~0); 8377#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8373#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8368#L26-1 [2019-11-28 02:58:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1617575020, now seen corresponding path program 10 times [2019-11-28 02:58:56,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447286565] [2019-11-28 02:58:56,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 14 times [2019-11-28 02:58:56,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852385444] [2019-11-28 02:58:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:56,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1283478862, now seen corresponding path program 10 times [2019-11-28 02:58:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:56,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396844856] [2019-11-28 02:58:56,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 122 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:56,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396844856] [2019-11-28 02:58:56,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787493186] [2019-11-28 02:58:56,987 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:57,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:58:57,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:57,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:58:57,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 122 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:57,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:57,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 18 [2019-11-28 02:58:57,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023031018] [2019-11-28 02:58:57,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 02:58:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:58:57,130 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. cyclomatic complexity: 14 Second operand 19 states. [2019-11-28 02:58:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:57,497 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2019-11-28 02:58:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:58:57,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 179 transitions. [2019-11-28 02:58:57,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:57,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 167 states and 177 transitions. [2019-11-28 02:58:57,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:57,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:57,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 177 transitions. [2019-11-28 02:58:57,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:57,501 INFO L688 BuchiCegarLoop]: Abstraction has 167 states and 177 transitions. [2019-11-28 02:58:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 177 transitions. [2019-11-28 02:58:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2019-11-28 02:58:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 02:58:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2019-11-28 02:58:57,504 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 166 transitions. [2019-11-28 02:58:57,504 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 166 transitions. [2019-11-28 02:58:57,504 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-28 02:58:57,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 166 transitions. [2019-11-28 02:58:57,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:57,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:57,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:57,506 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 13, 13, 13, 13, 1] [2019-11-28 02:58:57,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:57,507 INFO L794 eck$LassoCheckResult]: Stem: 8933#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 8934#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8979#L14 assume !(0 == main_~i~0); 9015#L14-2 assume !(main_~i~0 == main_~range~0); 9084#L17-1 assume !(1 == main_~up~0); 9088#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9086#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8942#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9081#L14 assume !(0 == main_~i~0); 9080#L14-2 assume !(main_~i~0 == main_~range~0); 9079#L17-1 assume !(1 == main_~up~0); 9078#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9077#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9076#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9075#L14 assume !(0 == main_~i~0); 9074#L14-2 assume !(main_~i~0 == main_~range~0); 9073#L17-1 assume !(1 == main_~up~0); 9072#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9071#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9070#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9069#L14 assume !(0 == main_~i~0); 9068#L14-2 assume !(main_~i~0 == main_~range~0); 9067#L17-1 assume !(1 == main_~up~0); 9066#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9065#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9064#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9063#L14 assume !(0 == main_~i~0); 9062#L14-2 assume !(main_~i~0 == main_~range~0); 9061#L17-1 assume !(1 == main_~up~0); 9060#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9059#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9058#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9057#L14 assume !(0 == main_~i~0); 9056#L14-2 assume !(main_~i~0 == main_~range~0); 9055#L17-1 assume !(1 == main_~up~0); 9054#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9053#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9052#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9051#L14 assume !(0 == main_~i~0); 9050#L14-2 assume !(main_~i~0 == main_~range~0); 9049#L17-1 assume !(1 == main_~up~0); 9048#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9047#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9046#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9045#L14 assume !(0 == main_~i~0); 9044#L14-2 assume !(main_~i~0 == main_~range~0); 9043#L17-1 assume !(1 == main_~up~0); 9042#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9041#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9040#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9039#L14 assume !(0 == main_~i~0); 9038#L14-2 assume !(main_~i~0 == main_~range~0); 9037#L17-1 assume !(1 == main_~up~0); 9036#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9035#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9034#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9033#L14 assume !(0 == main_~i~0); 9032#L14-2 assume !(main_~i~0 == main_~range~0); 9031#L17-1 assume !(1 == main_~up~0); 9030#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9029#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9028#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9027#L14 assume !(0 == main_~i~0); 9026#L14-2 assume !(main_~i~0 == main_~range~0); 9025#L17-1 assume !(1 == main_~up~0); 9024#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9023#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9022#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9021#L14 assume !(0 == main_~i~0); 9020#L14-2 assume !(main_~i~0 == main_~range~0); 9019#L17-1 assume !(1 == main_~up~0); 9018#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9017#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8987#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9014#L14 assume !(0 == main_~i~0); 9012#L14-2 assume !(main_~i~0 == main_~range~0); 9010#L17-1 assume !(1 == main_~up~0); 8991#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8986#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 8983#L26-1 [2019-11-28 02:58:57,507 INFO L796 eck$LassoCheckResult]: Loop: 8983#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8984#L14 assume 0 == main_~i~0;main_~up~0 := 1; 8985#L14-2 assume !(main_~i~0 == main_~range~0); 8955#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8946#L20-1 assume !(0 == main_~up~0); 8947#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9000#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8998#L14 assume !(0 == main_~i~0); 8996#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 8994#L17-1 assume !(1 == main_~up~0); 8992#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 8988#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 8983#L26-1 [2019-11-28 02:58:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1104938813, now seen corresponding path program 11 times [2019-11-28 02:58:57,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:57,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077356795] [2019-11-28 02:58:57,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:57,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 15 times [2019-11-28 02:58:57,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:57,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175771281] [2019-11-28 02:58:57,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:57,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1467257185, now seen corresponding path program 11 times [2019-11-28 02:58:57,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:57,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42926765] [2019-11-28 02:58:57,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 132 proven. 494 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:57,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42926765] [2019-11-28 02:58:57,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397023444] [2019-11-28 02:58:57,811 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:57,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-11-28 02:58:57,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:57,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:58:57,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 132 proven. 494 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:57,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:57,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 24 [2019-11-28 02:58:57,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364817264] [2019-11-28 02:58:58,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 02:58:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:58:58,051 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. cyclomatic complexity: 14 Second operand 25 states. [2019-11-28 02:58:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:58,647 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2019-11-28 02:58:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 02:58:58,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 185 transitions. [2019-11-28 02:58:58,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:58,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 173 states and 183 transitions. [2019-11-28 02:58:58,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:58,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:58,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 183 transitions. [2019-11-28 02:58:58,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:58,651 INFO L688 BuchiCegarLoop]: Abstraction has 173 states and 183 transitions. [2019-11-28 02:58:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 183 transitions. [2019-11-28 02:58:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-11-28 02:58:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-28 02:58:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2019-11-28 02:58:58,654 INFO L711 BuchiCegarLoop]: Abstraction has 162 states and 172 transitions. [2019-11-28 02:58:58,654 INFO L591 BuchiCegarLoop]: Abstraction has 162 states and 172 transitions. [2019-11-28 02:58:58,654 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-28 02:58:58,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 172 transitions. [2019-11-28 02:58:58,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:58,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:58,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:58,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 14, 14, 14, 14, 1] [2019-11-28 02:58:58,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:58,656 INFO L794 eck$LassoCheckResult]: Stem: 9610#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 9611#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9652#L14 assume !(0 == main_~i~0); 9688#L14-2 assume !(main_~i~0 == main_~range~0); 9763#L17-1 assume !(1 == main_~up~0); 9767#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9765#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9615#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9760#L14 assume !(0 == main_~i~0); 9759#L14-2 assume !(main_~i~0 == main_~range~0); 9758#L17-1 assume !(1 == main_~up~0); 9757#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9756#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9755#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9754#L14 assume !(0 == main_~i~0); 9753#L14-2 assume !(main_~i~0 == main_~range~0); 9752#L17-1 assume !(1 == main_~up~0); 9751#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9750#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9749#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9748#L14 assume !(0 == main_~i~0); 9747#L14-2 assume !(main_~i~0 == main_~range~0); 9746#L17-1 assume !(1 == main_~up~0); 9745#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9744#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9743#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9742#L14 assume !(0 == main_~i~0); 9741#L14-2 assume !(main_~i~0 == main_~range~0); 9740#L17-1 assume !(1 == main_~up~0); 9739#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9738#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9737#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9736#L14 assume !(0 == main_~i~0); 9735#L14-2 assume !(main_~i~0 == main_~range~0); 9734#L17-1 assume !(1 == main_~up~0); 9733#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9732#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9731#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9730#L14 assume !(0 == main_~i~0); 9729#L14-2 assume !(main_~i~0 == main_~range~0); 9728#L17-1 assume !(1 == main_~up~0); 9727#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9726#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9725#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9724#L14 assume !(0 == main_~i~0); 9723#L14-2 assume !(main_~i~0 == main_~range~0); 9722#L17-1 assume !(1 == main_~up~0); 9721#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9720#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9719#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9718#L14 assume !(0 == main_~i~0); 9717#L14-2 assume !(main_~i~0 == main_~range~0); 9716#L17-1 assume !(1 == main_~up~0); 9715#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9714#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9713#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9712#L14 assume !(0 == main_~i~0); 9711#L14-2 assume !(main_~i~0 == main_~range~0); 9710#L17-1 assume !(1 == main_~up~0); 9709#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9708#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9707#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9706#L14 assume !(0 == main_~i~0); 9705#L14-2 assume !(main_~i~0 == main_~range~0); 9704#L17-1 assume !(1 == main_~up~0); 9703#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9702#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9701#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9700#L14 assume !(0 == main_~i~0); 9699#L14-2 assume !(main_~i~0 == main_~range~0); 9698#L17-1 assume !(1 == main_~up~0); 9697#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9696#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9695#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9694#L14 assume !(0 == main_~i~0); 9693#L14-2 assume !(main_~i~0 == main_~range~0); 9692#L17-1 assume !(1 == main_~up~0); 9691#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9690#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9660#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9687#L14 assume !(0 == main_~i~0); 9685#L14-2 assume !(main_~i~0 == main_~range~0); 9683#L17-1 assume !(1 == main_~up~0); 9664#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9659#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 9656#L26-1 [2019-11-28 02:58:58,657 INFO L796 eck$LassoCheckResult]: Loop: 9656#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9657#L14 assume 0 == main_~i~0;main_~up~0 := 1; 9658#L14-2 assume !(main_~i~0 == main_~range~0); 9628#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9619#L20-1 assume !(0 == main_~up~0); 9620#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9673#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9671#L14 assume !(0 == main_~i~0); 9669#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 9667#L17-1 assume !(1 == main_~up~0); 9665#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 9661#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 9656#L26-1 [2019-11-28 02:58:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1699000654, now seen corresponding path program 12 times [2019-11-28 02:58:58,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519566703] [2019-11-28 02:58:58,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 16 times [2019-11-28 02:58:58,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901264469] [2019-11-28 02:58:58,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash -923236560, now seen corresponding path program 12 times [2019-11-28 02:58:58,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549318210] [2019-11-28 02:58:58,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 142 proven. 574 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549318210] [2019-11-28 02:58:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144362164] [2019-11-28 02:58:58,907 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:58,965 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-11-28 02:58:58,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:58:58,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:58:58,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 142 proven. 574 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:59,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:59,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 25 [2019-11-28 02:58:59,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637619598] [2019-11-28 02:58:59,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 02:58:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-11-28 02:58:59,169 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. cyclomatic complexity: 14 Second operand 26 states. [2019-11-28 02:58:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:59,658 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2019-11-28 02:58:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 02:58:59,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 191 transitions. [2019-11-28 02:58:59,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:59,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 179 states and 189 transitions. [2019-11-28 02:58:59,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:58:59,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:58:59,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 189 transitions. [2019-11-28 02:58:59,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:59,662 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 189 transitions. [2019-11-28 02:58:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 189 transitions. [2019-11-28 02:58:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 168. [2019-11-28 02:58:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 02:58:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2019-11-28 02:58:59,665 INFO L711 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2019-11-28 02:58:59,665 INFO L591 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2019-11-28 02:58:59,665 INFO L424 BuchiCegarLoop]: ======== Iteration 26============ [2019-11-28 02:58:59,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 178 transitions. [2019-11-28 02:58:59,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:58:59,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:59,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:59,667 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 15, 15, 1] [2019-11-28 02:58:59,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:59,668 INFO L794 eck$LassoCheckResult]: Stem: 10314#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 10315#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10356#L14 assume !(0 == main_~i~0); 10392#L14-2 assume !(main_~i~0 == main_~range~0); 10473#L17-1 assume !(1 == main_~up~0); 10477#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10475#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10319#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10470#L14 assume !(0 == main_~i~0); 10469#L14-2 assume !(main_~i~0 == main_~range~0); 10468#L17-1 assume !(1 == main_~up~0); 10467#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10466#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10465#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10464#L14 assume !(0 == main_~i~0); 10463#L14-2 assume !(main_~i~0 == main_~range~0); 10462#L17-1 assume !(1 == main_~up~0); 10461#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10460#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10459#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10458#L14 assume !(0 == main_~i~0); 10457#L14-2 assume !(main_~i~0 == main_~range~0); 10456#L17-1 assume !(1 == main_~up~0); 10455#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10454#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10453#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10452#L14 assume !(0 == main_~i~0); 10451#L14-2 assume !(main_~i~0 == main_~range~0); 10450#L17-1 assume !(1 == main_~up~0); 10449#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10448#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10447#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10446#L14 assume !(0 == main_~i~0); 10445#L14-2 assume !(main_~i~0 == main_~range~0); 10444#L17-1 assume !(1 == main_~up~0); 10443#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10442#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10441#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10440#L14 assume !(0 == main_~i~0); 10439#L14-2 assume !(main_~i~0 == main_~range~0); 10438#L17-1 assume !(1 == main_~up~0); 10437#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10436#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10435#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10434#L14 assume !(0 == main_~i~0); 10433#L14-2 assume !(main_~i~0 == main_~range~0); 10432#L17-1 assume !(1 == main_~up~0); 10431#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10430#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10429#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10428#L14 assume !(0 == main_~i~0); 10427#L14-2 assume !(main_~i~0 == main_~range~0); 10426#L17-1 assume !(1 == main_~up~0); 10425#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10424#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10423#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10422#L14 assume !(0 == main_~i~0); 10421#L14-2 assume !(main_~i~0 == main_~range~0); 10420#L17-1 assume !(1 == main_~up~0); 10419#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10418#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10417#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10416#L14 assume !(0 == main_~i~0); 10415#L14-2 assume !(main_~i~0 == main_~range~0); 10414#L17-1 assume !(1 == main_~up~0); 10413#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10412#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10411#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10410#L14 assume !(0 == main_~i~0); 10409#L14-2 assume !(main_~i~0 == main_~range~0); 10408#L17-1 assume !(1 == main_~up~0); 10407#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10406#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10405#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10404#L14 assume !(0 == main_~i~0); 10403#L14-2 assume !(main_~i~0 == main_~range~0); 10402#L17-1 assume !(1 == main_~up~0); 10401#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10400#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10399#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10398#L14 assume !(0 == main_~i~0); 10397#L14-2 assume !(main_~i~0 == main_~range~0); 10396#L17-1 assume !(1 == main_~up~0); 10395#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10394#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10364#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10391#L14 assume !(0 == main_~i~0); 10389#L14-2 assume !(main_~i~0 == main_~range~0); 10387#L17-1 assume !(1 == main_~up~0); 10368#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10363#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 10360#L26-1 [2019-11-28 02:58:59,668 INFO L796 eck$LassoCheckResult]: Loop: 10360#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10361#L14 assume 0 == main_~i~0;main_~up~0 := 1; 10362#L14-2 assume !(main_~i~0 == main_~range~0); 10332#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10323#L20-1 assume !(0 == main_~up~0); 10324#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10377#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10375#L14 assume !(0 == main_~i~0); 10373#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 10371#L17-1 assume !(1 == main_~up~0); 10369#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 10365#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 10360#L26-1 [2019-11-28 02:58:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1051735393, now seen corresponding path program 13 times [2019-11-28 02:58:59,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63161839] [2019-11-28 02:58:59,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 17 times [2019-11-28 02:58:59,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923244436] [2019-11-28 02:58:59,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1348784383, now seen corresponding path program 13 times [2019-11-28 02:58:59,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604367245] [2019-11-28 02:58:59,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 152 proven. 660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:59,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604367245] [2019-11-28 02:58:59,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501586299] [2019-11-28 02:58:59,923 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:58:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 152 proven. 660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:58:59,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:58:59,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 21 [2019-11-28 02:58:59,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311486006] [2019-11-28 02:59:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 02:59:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:59:00,042 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. cyclomatic complexity: 14 Second operand 22 states. [2019-11-28 02:59:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:00,380 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2019-11-28 02:59:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 02:59:00,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 197 transitions. [2019-11-28 02:59:00,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:00,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 185 states and 195 transitions. [2019-11-28 02:59:00,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:59:00,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:00,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 195 transitions. [2019-11-28 02:59:00,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,384 INFO L688 BuchiCegarLoop]: Abstraction has 185 states and 195 transitions. [2019-11-28 02:59:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 195 transitions. [2019-11-28 02:59:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 174. [2019-11-28 02:59:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-28 02:59:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2019-11-28 02:59:00,387 INFO L711 BuchiCegarLoop]: Abstraction has 174 states and 184 transitions. [2019-11-28 02:59:00,387 INFO L591 BuchiCegarLoop]: Abstraction has 174 states and 184 transitions. [2019-11-28 02:59:00,388 INFO L424 BuchiCegarLoop]: ======== Iteration 27============ [2019-11-28 02:59:00,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 184 transitions. [2019-11-28 02:59:00,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:00,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:00,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:00,390 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 16, 16, 16, 16, 1] [2019-11-28 02:59:00,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:00,390 INFO L794 eck$LassoCheckResult]: Stem: 11022#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11023#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11064#L14 assume !(0 == main_~i~0); 11100#L14-2 assume !(main_~i~0 == main_~range~0); 11187#L17-1 assume !(1 == main_~up~0); 11191#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11189#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11027#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11184#L14 assume !(0 == main_~i~0); 11183#L14-2 assume !(main_~i~0 == main_~range~0); 11182#L17-1 assume !(1 == main_~up~0); 11181#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11180#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11179#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11178#L14 assume !(0 == main_~i~0); 11177#L14-2 assume !(main_~i~0 == main_~range~0); 11176#L17-1 assume !(1 == main_~up~0); 11175#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11174#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11173#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11172#L14 assume !(0 == main_~i~0); 11171#L14-2 assume !(main_~i~0 == main_~range~0); 11170#L17-1 assume !(1 == main_~up~0); 11169#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11168#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11167#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11166#L14 assume !(0 == main_~i~0); 11165#L14-2 assume !(main_~i~0 == main_~range~0); 11164#L17-1 assume !(1 == main_~up~0); 11163#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11162#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11161#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11160#L14 assume !(0 == main_~i~0); 11159#L14-2 assume !(main_~i~0 == main_~range~0); 11158#L17-1 assume !(1 == main_~up~0); 11157#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11156#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11155#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11154#L14 assume !(0 == main_~i~0); 11153#L14-2 assume !(main_~i~0 == main_~range~0); 11152#L17-1 assume !(1 == main_~up~0); 11151#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11150#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11149#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11148#L14 assume !(0 == main_~i~0); 11147#L14-2 assume !(main_~i~0 == main_~range~0); 11146#L17-1 assume !(1 == main_~up~0); 11145#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11144#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11143#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11142#L14 assume !(0 == main_~i~0); 11141#L14-2 assume !(main_~i~0 == main_~range~0); 11140#L17-1 assume !(1 == main_~up~0); 11139#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11138#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11137#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11136#L14 assume !(0 == main_~i~0); 11135#L14-2 assume !(main_~i~0 == main_~range~0); 11134#L17-1 assume !(1 == main_~up~0); 11133#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11132#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11131#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11130#L14 assume !(0 == main_~i~0); 11129#L14-2 assume !(main_~i~0 == main_~range~0); 11128#L17-1 assume !(1 == main_~up~0); 11127#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11126#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11125#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11124#L14 assume !(0 == main_~i~0); 11123#L14-2 assume !(main_~i~0 == main_~range~0); 11122#L17-1 assume !(1 == main_~up~0); 11121#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11120#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11119#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11118#L14 assume !(0 == main_~i~0); 11117#L14-2 assume !(main_~i~0 == main_~range~0); 11116#L17-1 assume !(1 == main_~up~0); 11115#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11114#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11113#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11112#L14 assume !(0 == main_~i~0); 11111#L14-2 assume !(main_~i~0 == main_~range~0); 11110#L17-1 assume !(1 == main_~up~0); 11109#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11108#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11107#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11106#L14 assume !(0 == main_~i~0); 11105#L14-2 assume !(main_~i~0 == main_~range~0); 11104#L17-1 assume !(1 == main_~up~0); 11103#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11102#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11072#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11099#L14 assume !(0 == main_~i~0); 11097#L14-2 assume !(main_~i~0 == main_~range~0); 11095#L17-1 assume !(1 == main_~up~0); 11076#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11071#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11068#L26-1 [2019-11-28 02:59:00,390 INFO L796 eck$LassoCheckResult]: Loop: 11068#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11069#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11070#L14-2 assume !(main_~i~0 == main_~range~0); 11040#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11031#L20-1 assume !(0 == main_~up~0); 11032#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11085#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11083#L14 assume !(0 == main_~i~0); 11081#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11079#L17-1 assume !(1 == main_~up~0); 11077#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11073#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11068#L26-1 [2019-11-28 02:59:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash -507714768, now seen corresponding path program 14 times [2019-11-28 02:59:00,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192448339] [2019-11-28 02:59:00,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 18 times [2019-11-28 02:59:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682675586] [2019-11-28 02:59:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash -178588142, now seen corresponding path program 14 times [2019-11-28 02:59:00,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036773348] [2019-11-28 02:59:00,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 162 proven. 752 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036773348] [2019-11-28 02:59:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874807319] [2019-11-28 02:59:00,727 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:00,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:00,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:00,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 162 proven. 752 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 22 [2019-11-28 02:59:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407434015] [2019-11-28 02:59:00,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 02:59:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:59:00,933 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. cyclomatic complexity: 14 Second operand 23 states. [2019-11-28 02:59:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:01,367 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2019-11-28 02:59:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 02:59:01,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 203 transitions. [2019-11-28 02:59:01,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:01,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 191 states and 201 transitions. [2019-11-28 02:59:01,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:59:01,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:01,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 201 transitions. [2019-11-28 02:59:01,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,371 INFO L688 BuchiCegarLoop]: Abstraction has 191 states and 201 transitions. [2019-11-28 02:59:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 201 transitions. [2019-11-28 02:59:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2019-11-28 02:59:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 02:59:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2019-11-28 02:59:01,375 INFO L711 BuchiCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-11-28 02:59:01,375 INFO L591 BuchiCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-11-28 02:59:01,375 INFO L424 BuchiCegarLoop]: ======== Iteration 28============ [2019-11-28 02:59:01,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 190 transitions. [2019-11-28 02:59:01,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:01,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 17, 17, 17, 17, 1] [2019-11-28 02:59:01,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:01,378 INFO L794 eck$LassoCheckResult]: Stem: 11757#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 11758#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11803#L14 assume !(0 == main_~i~0); 11839#L14-2 assume !(main_~i~0 == main_~range~0); 11932#L17-1 assume !(1 == main_~up~0); 11936#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11934#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11766#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11929#L14 assume !(0 == main_~i~0); 11928#L14-2 assume !(main_~i~0 == main_~range~0); 11927#L17-1 assume !(1 == main_~up~0); 11926#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11925#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11924#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11923#L14 assume !(0 == main_~i~0); 11922#L14-2 assume !(main_~i~0 == main_~range~0); 11921#L17-1 assume !(1 == main_~up~0); 11920#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11919#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11918#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11917#L14 assume !(0 == main_~i~0); 11916#L14-2 assume !(main_~i~0 == main_~range~0); 11915#L17-1 assume !(1 == main_~up~0); 11914#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11913#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11912#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11911#L14 assume !(0 == main_~i~0); 11910#L14-2 assume !(main_~i~0 == main_~range~0); 11909#L17-1 assume !(1 == main_~up~0); 11908#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11907#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11906#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11905#L14 assume !(0 == main_~i~0); 11904#L14-2 assume !(main_~i~0 == main_~range~0); 11903#L17-1 assume !(1 == main_~up~0); 11902#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11901#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11900#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11899#L14 assume !(0 == main_~i~0); 11898#L14-2 assume !(main_~i~0 == main_~range~0); 11897#L17-1 assume !(1 == main_~up~0); 11896#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11895#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11894#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11893#L14 assume !(0 == main_~i~0); 11892#L14-2 assume !(main_~i~0 == main_~range~0); 11891#L17-1 assume !(1 == main_~up~0); 11890#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11889#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11888#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11887#L14 assume !(0 == main_~i~0); 11886#L14-2 assume !(main_~i~0 == main_~range~0); 11885#L17-1 assume !(1 == main_~up~0); 11884#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11883#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11882#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11881#L14 assume !(0 == main_~i~0); 11880#L14-2 assume !(main_~i~0 == main_~range~0); 11879#L17-1 assume !(1 == main_~up~0); 11878#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11877#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11876#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11875#L14 assume !(0 == main_~i~0); 11874#L14-2 assume !(main_~i~0 == main_~range~0); 11873#L17-1 assume !(1 == main_~up~0); 11872#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11871#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11870#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11869#L14 assume !(0 == main_~i~0); 11868#L14-2 assume !(main_~i~0 == main_~range~0); 11867#L17-1 assume !(1 == main_~up~0); 11866#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11865#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11864#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11863#L14 assume !(0 == main_~i~0); 11862#L14-2 assume !(main_~i~0 == main_~range~0); 11861#L17-1 assume !(1 == main_~up~0); 11860#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11859#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11858#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11857#L14 assume !(0 == main_~i~0); 11856#L14-2 assume !(main_~i~0 == main_~range~0); 11855#L17-1 assume !(1 == main_~up~0); 11854#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11853#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11852#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11851#L14 assume !(0 == main_~i~0); 11850#L14-2 assume !(main_~i~0 == main_~range~0); 11849#L17-1 assume !(1 == main_~up~0); 11848#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11847#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11846#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11845#L14 assume !(0 == main_~i~0); 11844#L14-2 assume !(main_~i~0 == main_~range~0); 11843#L17-1 assume !(1 == main_~up~0); 11842#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11841#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11811#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11838#L14 assume !(0 == main_~i~0); 11836#L14-2 assume !(main_~i~0 == main_~range~0); 11834#L17-1 assume !(1 == main_~up~0); 11815#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11810#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 11807#L26-1 [2019-11-28 02:59:01,378 INFO L796 eck$LassoCheckResult]: Loop: 11807#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11808#L14 assume 0 == main_~i~0;main_~up~0 := 1; 11809#L14-2 assume !(main_~i~0 == main_~range~0); 11779#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11770#L20-1 assume !(0 == main_~up~0); 11771#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11824#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11822#L14 assume !(0 == main_~i~0); 11820#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 11818#L17-1 assume !(1 == main_~up~0); 11816#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 11812#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 11807#L26-1 [2019-11-28 02:59:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash -933262591, now seen corresponding path program 15 times [2019-11-28 02:59:01,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477390815] [2019-11-28 02:59:01,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 19 times [2019-11-28 02:59:01,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951473464] [2019-11-28 02:59:01,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 724790371, now seen corresponding path program 15 times [2019-11-28 02:59:01,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307877060] [2019-11-28 02:59:01,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 172 proven. 850 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:01,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307877060] [2019-11-28 02:59:01,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047016860] [2019-11-28 02:59:01,710 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:01,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-11-28 02:59:01,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:01,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 172 proven. 850 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:01,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:01,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 24 [2019-11-28 02:59:01,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487469036] [2019-11-28 02:59:01,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 02:59:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:59:01,889 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. cyclomatic complexity: 14 Second operand 25 states. [2019-11-28 02:59:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:02,332 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2019-11-28 02:59:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 02:59:02,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 209 transitions. [2019-11-28 02:59:02,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:02,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 197 states and 207 transitions. [2019-11-28 02:59:02,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:59:02,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:02,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 207 transitions. [2019-11-28 02:59:02,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,335 INFO L688 BuchiCegarLoop]: Abstraction has 197 states and 207 transitions. [2019-11-28 02:59:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 207 transitions. [2019-11-28 02:59:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2019-11-28 02:59:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 02:59:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2019-11-28 02:59:02,338 INFO L711 BuchiCegarLoop]: Abstraction has 186 states and 196 transitions. [2019-11-28 02:59:02,338 INFO L591 BuchiCegarLoop]: Abstraction has 186 states and 196 transitions. [2019-11-28 02:59:02,339 INFO L424 BuchiCegarLoop]: ======== Iteration 29============ [2019-11-28 02:59:02,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 196 transitions. [2019-11-28 02:59:02,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:02,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 18, 18, 18, 18, 1] [2019-11-28 02:59:02,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:02,341 INFO L794 eck$LassoCheckResult]: Stem: 12530#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 12531#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12576#L14 assume !(0 == main_~i~0); 12612#L14-2 assume !(main_~i~0 == main_~range~0); 12711#L17-1 assume !(1 == main_~up~0); 12715#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12713#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12539#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12708#L14 assume !(0 == main_~i~0); 12707#L14-2 assume !(main_~i~0 == main_~range~0); 12706#L17-1 assume !(1 == main_~up~0); 12705#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12704#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12703#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12702#L14 assume !(0 == main_~i~0); 12701#L14-2 assume !(main_~i~0 == main_~range~0); 12700#L17-1 assume !(1 == main_~up~0); 12699#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12698#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12697#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12696#L14 assume !(0 == main_~i~0); 12695#L14-2 assume !(main_~i~0 == main_~range~0); 12694#L17-1 assume !(1 == main_~up~0); 12693#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12692#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12691#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12690#L14 assume !(0 == main_~i~0); 12689#L14-2 assume !(main_~i~0 == main_~range~0); 12688#L17-1 assume !(1 == main_~up~0); 12687#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12686#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12685#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12684#L14 assume !(0 == main_~i~0); 12683#L14-2 assume !(main_~i~0 == main_~range~0); 12682#L17-1 assume !(1 == main_~up~0); 12681#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12680#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12679#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12678#L14 assume !(0 == main_~i~0); 12677#L14-2 assume !(main_~i~0 == main_~range~0); 12676#L17-1 assume !(1 == main_~up~0); 12675#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12674#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12673#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12672#L14 assume !(0 == main_~i~0); 12671#L14-2 assume !(main_~i~0 == main_~range~0); 12670#L17-1 assume !(1 == main_~up~0); 12669#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12668#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12667#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12666#L14 assume !(0 == main_~i~0); 12665#L14-2 assume !(main_~i~0 == main_~range~0); 12664#L17-1 assume !(1 == main_~up~0); 12663#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12662#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12661#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12660#L14 assume !(0 == main_~i~0); 12659#L14-2 assume !(main_~i~0 == main_~range~0); 12658#L17-1 assume !(1 == main_~up~0); 12657#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12656#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12655#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12654#L14 assume !(0 == main_~i~0); 12653#L14-2 assume !(main_~i~0 == main_~range~0); 12652#L17-1 assume !(1 == main_~up~0); 12651#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12650#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12649#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12648#L14 assume !(0 == main_~i~0); 12647#L14-2 assume !(main_~i~0 == main_~range~0); 12646#L17-1 assume !(1 == main_~up~0); 12645#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12644#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12643#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12642#L14 assume !(0 == main_~i~0); 12641#L14-2 assume !(main_~i~0 == main_~range~0); 12640#L17-1 assume !(1 == main_~up~0); 12639#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12638#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12637#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12636#L14 assume !(0 == main_~i~0); 12635#L14-2 assume !(main_~i~0 == main_~range~0); 12634#L17-1 assume !(1 == main_~up~0); 12633#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12632#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12631#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12630#L14 assume !(0 == main_~i~0); 12629#L14-2 assume !(main_~i~0 == main_~range~0); 12628#L17-1 assume !(1 == main_~up~0); 12627#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12626#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12625#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12624#L14 assume !(0 == main_~i~0); 12623#L14-2 assume !(main_~i~0 == main_~range~0); 12622#L17-1 assume !(1 == main_~up~0); 12621#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12620#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12619#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12618#L14 assume !(0 == main_~i~0); 12617#L14-2 assume !(main_~i~0 == main_~range~0); 12616#L17-1 assume !(1 == main_~up~0); 12615#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12614#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12584#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12611#L14 assume !(0 == main_~i~0); 12609#L14-2 assume !(main_~i~0 == main_~range~0); 12607#L17-1 assume !(1 == main_~up~0); 12588#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12583#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 12580#L26-1 [2019-11-28 02:59:02,341 INFO L796 eck$LassoCheckResult]: Loop: 12580#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12581#L14 assume 0 == main_~i~0;main_~up~0 := 1; 12582#L14-2 assume !(main_~i~0 == main_~range~0); 12552#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 12543#L20-1 assume !(0 == main_~up~0); 12544#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12597#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12595#L14 assume !(0 == main_~i~0); 12593#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 12591#L17-1 assume !(1 == main_~up~0); 12589#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 12585#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 12580#L26-1 [2019-11-28 02:59:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 236933650, now seen corresponding path program 16 times [2019-11-28 02:59:02,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420208573] [2019-11-28 02:59:02,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 20 times [2019-11-28 02:59:02,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336465115] [2019-11-28 02:59:02,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2067014132, now seen corresponding path program 16 times [2019-11-28 02:59:02,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969907548] [2019-11-28 02:59:02,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 182 proven. 954 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969907548] [2019-11-28 02:59:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877314420] [2019-11-28 02:59:03,141 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:03,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:03,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:03,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 182 proven. 954 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:59:03,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:03,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 24 [2019-11-28 02:59:03,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216915002] [2019-11-28 02:59:03,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 02:59:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:59:03,335 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. cyclomatic complexity: 14 Second operand 25 states. [2019-11-28 02:59:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,723 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2019-11-28 02:59:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 02:59:03,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 215 transitions. [2019-11-28 02:59:03,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:03,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 203 states and 213 transitions. [2019-11-28 02:59:03,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:59:03,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 02:59:03,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 213 transitions. [2019-11-28 02:59:03,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,726 INFO L688 BuchiCegarLoop]: Abstraction has 203 states and 213 transitions. [2019-11-28 02:59:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 213 transitions. [2019-11-28 02:59:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2019-11-28 02:59:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-28 02:59:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 202 transitions. [2019-11-28 02:59:03,731 INFO L711 BuchiCegarLoop]: Abstraction has 192 states and 202 transitions. [2019-11-28 02:59:03,731 INFO L591 BuchiCegarLoop]: Abstraction has 192 states and 202 transitions. [2019-11-28 02:59:03,731 INFO L424 BuchiCegarLoop]: ======== Iteration 30============ [2019-11-28 02:59:03,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 202 transitions. [2019-11-28 02:59:03,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 02:59:03,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,734 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 19, 19, 19, 19, 1] [2019-11-28 02:59:03,734 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:03,734 INFO L794 eck$LassoCheckResult]: Stem: 13335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0, main_~up~0;havoc main_~i~0;havoc main_~range~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20;main_~up~0 := 0; 13336#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13377#L14 assume !(0 == main_~i~0); 13413#L14-2 assume !(main_~i~0 == main_~range~0); 13518#L17-1 assume !(1 == main_~up~0); 13522#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13520#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13340#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13515#L14 assume !(0 == main_~i~0); 13514#L14-2 assume !(main_~i~0 == main_~range~0); 13513#L17-1 assume !(1 == main_~up~0); 13512#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13511#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13510#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13509#L14 assume !(0 == main_~i~0); 13508#L14-2 assume !(main_~i~0 == main_~range~0); 13507#L17-1 assume !(1 == main_~up~0); 13506#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13505#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13504#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13503#L14 assume !(0 == main_~i~0); 13502#L14-2 assume !(main_~i~0 == main_~range~0); 13501#L17-1 assume !(1 == main_~up~0); 13500#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13499#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13498#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13497#L14 assume !(0 == main_~i~0); 13496#L14-2 assume !(main_~i~0 == main_~range~0); 13495#L17-1 assume !(1 == main_~up~0); 13494#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13493#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13492#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13491#L14 assume !(0 == main_~i~0); 13490#L14-2 assume !(main_~i~0 == main_~range~0); 13489#L17-1 assume !(1 == main_~up~0); 13488#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13487#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13486#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13485#L14 assume !(0 == main_~i~0); 13484#L14-2 assume !(main_~i~0 == main_~range~0); 13483#L17-1 assume !(1 == main_~up~0); 13482#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13481#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13480#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13479#L14 assume !(0 == main_~i~0); 13478#L14-2 assume !(main_~i~0 == main_~range~0); 13477#L17-1 assume !(1 == main_~up~0); 13476#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13475#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13474#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13473#L14 assume !(0 == main_~i~0); 13472#L14-2 assume !(main_~i~0 == main_~range~0); 13471#L17-1 assume !(1 == main_~up~0); 13470#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13469#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13468#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13467#L14 assume !(0 == main_~i~0); 13466#L14-2 assume !(main_~i~0 == main_~range~0); 13465#L17-1 assume !(1 == main_~up~0); 13464#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13463#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13462#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13461#L14 assume !(0 == main_~i~0); 13460#L14-2 assume !(main_~i~0 == main_~range~0); 13459#L17-1 assume !(1 == main_~up~0); 13458#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13457#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13456#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13455#L14 assume !(0 == main_~i~0); 13454#L14-2 assume !(main_~i~0 == main_~range~0); 13453#L17-1 assume !(1 == main_~up~0); 13452#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13451#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13450#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13449#L14 assume !(0 == main_~i~0); 13448#L14-2 assume !(main_~i~0 == main_~range~0); 13447#L17-1 assume !(1 == main_~up~0); 13446#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13445#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13444#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13443#L14 assume !(0 == main_~i~0); 13442#L14-2 assume !(main_~i~0 == main_~range~0); 13441#L17-1 assume !(1 == main_~up~0); 13440#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13439#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13438#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13437#L14 assume !(0 == main_~i~0); 13436#L14-2 assume !(main_~i~0 == main_~range~0); 13435#L17-1 assume !(1 == main_~up~0); 13434#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13433#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13432#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13431#L14 assume !(0 == main_~i~0); 13430#L14-2 assume !(main_~i~0 == main_~range~0); 13429#L17-1 assume !(1 == main_~up~0); 13428#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13427#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13426#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13425#L14 assume !(0 == main_~i~0); 13424#L14-2 assume !(main_~i~0 == main_~range~0); 13423#L17-1 assume !(1 == main_~up~0); 13422#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13421#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13420#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13419#L14 assume !(0 == main_~i~0); 13418#L14-2 assume !(main_~i~0 == main_~range~0); 13417#L17-1 assume !(1 == main_~up~0); 13416#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13415#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13385#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13412#L14 assume !(0 == main_~i~0); 13410#L14-2 assume !(main_~i~0 == main_~range~0); 13408#L17-1 assume !(1 == main_~up~0); 13389#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13384#L23-1 assume main_~i~0 == main_~range~0 - 2;main_~range~0 := main_~range~0 - 1; 13381#L26-1 [2019-11-28 02:59:03,735 INFO L796 eck$LassoCheckResult]: Loop: 13381#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13382#L14 assume 0 == main_~i~0;main_~up~0 := 1; 13383#L14-2 assume !(main_~i~0 == main_~range~0); 13353#L17-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13344#L20-1 assume !(0 == main_~up~0); 13345#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 13398#L26-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13396#L14 assume !(0 == main_~i~0); 13394#L14-2 assume main_~i~0 == main_~range~0;main_~up~0 := 0; 13392#L17-1 assume !(1 == main_~up~0); 13390#L20-1 assume 0 == main_~up~0;main_~i~0 := main_~i~0 - 1; 13386#L23-1 assume !(main_~i~0 == main_~range~0 - 2); 13381#L26-1 [2019-11-28 02:59:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1140312163, now seen corresponding path program 17 times [2019-11-28 02:59:03,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903519059] [2019-11-28 02:59:03,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash -724803229, now seen corresponding path program 21 times [2019-11-28 02:59:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157914947] [2019-11-28 02:59:03,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1988057403, now seen corresponding path program 17 times [2019-11-28 02:59:03,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864551651] [2019-11-28 02:59:03,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,790 WARN L192 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 128 [2019-11-28 02:59:04,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:59:04 BoogieIcfgContainer [2019-11-28 02:59:04,840 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:59:04,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:59:04,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:59:04,841 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:59:04,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:43" (3/4) ... [2019-11-28 02:59:04,845 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:59:04,920 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:59:04,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:59:04,922 INFO L168 Benchmark]: Toolchain (without parser) took 21554.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.3 MB). Free memory was 960.4 MB in the beginning and 871.9 MB in the end (delta: 88.4 MB). Peak memory consumption was 504.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,923 INFO L168 Benchmark]: CDTParser took 0.37 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 02:59:04,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.51 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 02:59:04,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,924 INFO L168 Benchmark]: Boogie Preprocessor took 21.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,925 INFO L168 Benchmark]: RCFGBuilder took 234.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,926 INFO L168 Benchmark]: BuchiAutomizer took 20873.11 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 305.1 MB). Free memory was 1.1 GB in the beginning and 883.9 MB in the end (delta: 205.6 MB). Peak memory consumption was 510.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,926 INFO L168 Benchmark]: Witness Printer took 80.61 ms. Allocated memory is still 1.4 GB. Free memory was 883.9 MB in the beginning and 871.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:04,928 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.37 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 245.51 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 93.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20873.11 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 305.1 MB). Free memory was 1.1 GB in the beginning and 883.9 MB in the end (delta: 205.6 MB). Peak memory consumption was 510.7 MB. Max. memory is 11.5 GB. * Witness Printer took 80.61 ms. Allocated memory is still 1.4 GB. Free memory was 883.9 MB in the beginning and 871.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. 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 32 terminating modules (27 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 27 modules have a trivial ranking function, the largest among these consists of 26 locations. The remainder module has 192 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.7s and 30 iterations. TraceHistogramMax:19. Analysis of lassos took 12.6s. Construction of modules took 3.2s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 29. Automata minimization 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 481 StatesRemovedByMinimization, 30 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 192 states and ocurred in iteration 29. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 340 SDtfs, 2028 SDslu, 881 SDs, 0 SdLazy, 3873 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc17 concLT1 SILN2 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax140 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp63 dnf137 smp95 tf106 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, range=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28b4b7e6=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 Loop: [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...