./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.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-crafted/McCarthy91_Iteration.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 f36e762e796a59800b85d8514c20c7f73c19b5c1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:56:20,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:56:20,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:56:20,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:56:20,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:56:20,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:56:20,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:56:20,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:56:20,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:56:20,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:56:20,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:56:20,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:56:20,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:56:20,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:56:20,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:56:20,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:56:20,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:56:20,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:56:20,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:56:20,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:56:20,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:56:20,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:56:20,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:56:20,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:56:20,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:56:20,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:56:20,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:56:20,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:56:20,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:56:20,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:56:20,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:56:20,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:56:20,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:56:20,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:56:20,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:56:20,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:56:20,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:56:20,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:56:20,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:56:20,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:56:20,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:56:20,188 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:56:20,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:56:20,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:56:20,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:56:20,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:56:20,212 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:56:20,213 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:56:20,213 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:56:20,213 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:56:20,213 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:56:20,214 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:56:20,215 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:56:20,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:56:20,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:56:20,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:56:20,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:56:20,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:56:20,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:56:20,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:56:20,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:56:20,218 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:56:20,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:56:20,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:56:20,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:56:20,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:56:20,219 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:56:20,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:56:20,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:56:20,220 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:56:20,222 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:56:20,222 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 -> f36e762e796a59800b85d8514c20c7f73c19b5c1 [2019-11-28 02:56:20,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:56:20,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:56:20,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:56:20,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:56:20,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:56:20,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-11-28 02:56:20,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa16430d/270a7da103bf4f1d937ff0476b321b24/FLAG4c60245ae [2019-11-28 02:56:21,053 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:56:21,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-11-28 02:56:21,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa16430d/270a7da103bf4f1d937ff0476b321b24/FLAG4c60245ae [2019-11-28 02:56:21,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa16430d/270a7da103bf4f1d937ff0476b321b24 [2019-11-28 02:56:21,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:56:21,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:56:21,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:56:21,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:56:21,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:56:21,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19255d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21, skipping insertion in model container [2019-11-28 02:56:21,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:56:21,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:56:21,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:56:21,727 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:56:21,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:56:21,763 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:56:21,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21 WrapperNode [2019-11-28 02:56:21,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:56:21,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:56:21,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:56:21,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:56:21,776 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:56:21" (1/1) ... [2019-11-28 02:56:21,784 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:56:21" (1/1) ... [2019-11-28 02:56:21,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:56:21,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:56:21,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:56:21,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:56:21,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (1/1) ... [2019-11-28 02:56:21,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:56:21,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:56:21,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:56:21,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:56:21,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (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:56:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:56:21,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:56:22,113 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:56:22,114 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:56:22,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:22 BoogieIcfgContainer [2019-11-28 02:56:22,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:56:22,116 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:56:22,116 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:56:22,120 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:56:22,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:22,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:56:21" (1/3) ... [2019-11-28 02:56:22,122 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d262c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:56:22, skipping insertion in model container [2019-11-28 02:56:22,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:22,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:21" (2/3) ... [2019-11-28 02:56:22,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d262c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:56:22, skipping insertion in model container [2019-11-28 02:56:22,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:22,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:22" (3/3) ... [2019-11-28 02:56:22,125 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2019-11-28 02:56:22,172 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:56:22,173 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:56:22,173 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:56:22,173 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:56:22,173 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:56:22,173 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:56:22,174 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:56:22,174 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:56:22,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 02:56:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:22,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:22,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:22,218 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:56:22,218 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:22,218 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:56:22,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 02:56:22,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:22,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:22,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:22,220 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:56:22,221 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:22,229 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 8#L15-2true [2019-11-28 02:56:22,230 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true assume !!(main_~c~0 > 0); 3#L15true assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 8#L15-2true [2019-11-28 02:56:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:56:22,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:22,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346698971] [2019-11-28 02:56:22,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,352 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-28 02:56:22,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:22,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367360487] [2019-11-28 02:56:22,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-28 02:56:22,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:22,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374806255] [2019-11-28 02:56:22,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:22,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:22,517 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:22,518 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:22,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:22,518 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:22,518 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:22,534 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,534 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:22,534 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:22,535 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-11-28 02:56:22,535 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:22,535 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:22,567 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:56:22,592 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:56:22,598 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:56:22,615 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:56:22,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:22,733 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:22,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:22,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:22,747 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:22,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:22,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:22,763 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:22,770 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:22,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:22,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:22,806 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:22,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:22,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:22,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:22,807 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:22,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:22,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:22,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-11-28 02:56:22,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:22,808 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:22,812 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:56:22,817 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:56:22,825 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:56:22,834 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:56:22,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:22,940 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:22,958 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:56:22,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:22,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:22,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:22,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:22,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:22,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:22,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:22,992 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:56:22,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:22,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:22,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:22,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:22,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:22,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe 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:56:23,019 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:56:23,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:23,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:23,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:23,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:23,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:23,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:23,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:23,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:23,040 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:23,041 INFO L444 ModelExtractionUtils]: 0 out of 3 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:23,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:23,058 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:23,058 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:23,059 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 02:56:23,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:23,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:23,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:23,126 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:23,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:23,130 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:56:23,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:56:23,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-28 02:56:23,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-11-28 02:56:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 02:56:23,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 02:56:23,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:56:23,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:56:23,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-28 02:56:23,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:23,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-28 02:56:23,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 02:56:23,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-28 02:56:23,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-28 02:56:23,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:23,226 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:56:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-28 02:56:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 02:56:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 02:56:23,249 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:56:23,249 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:56:23,249 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:56:23,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-28 02:56:23,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:23,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:23,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:23,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:56:23,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:23,251 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 68#L15-2 assume !!(main_~c~0 > 0); 63#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 64#L15-2 [2019-11-28 02:56:23,251 INFO L796 eck$LassoCheckResult]: Loop: 64#L15-2 assume !!(main_~c~0 > 0); 69#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 64#L15-2 [2019-11-28 02:56:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 02:56:23,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469914321] [2019-11-28 02:56:23,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-28 02:56:23,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625290069] [2019-11-28 02:56:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-28 02:56:23,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714379594] [2019-11-28 02:56:23,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,316 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:23,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:23,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:23,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:23,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:23,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:23,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:23,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-11-28 02:56:23,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:23,317 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:23,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:23,325 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:56:23,332 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:56:23,340 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:56:23,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:23,400 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:23,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:23,413 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:23,413 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:23,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:23,432 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:23,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:23,465 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:23,469 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:23,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:23,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:23,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:23,470 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:23,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:23,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:23,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-11-28 02:56:23,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:23,471 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:23,473 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:56:23,478 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:56:23,491 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:56:23,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:23,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:23,558 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:23,572 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:56:23,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:23,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:23,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:23,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:23,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:23,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:23,602 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:23,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:23,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:23,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:23,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:23,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:23,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:23,614 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:23,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:23,624 INFO L444 ModelExtractionUtils]: 0 out of 3 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:23,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:23,630 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:23,630 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:23,630 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:23,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:23,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:23,682 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:23,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:23,696 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:56:23,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:23,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 02:56:23,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-11-28 02:56:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:56:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:56:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:56:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 02:56:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:23,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-28 02:56:23,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:23,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 02:56:23,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:23,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:56:23,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-28 02:56:23,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:23,723 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:56:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-28 02:56:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 02:56:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 02:56:23,728 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:56:23,728 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 02:56:23,728 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:56:23,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-28 02:56:23,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 02:56:23,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:23,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:23,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:23,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:23,731 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 122#L15-2 assume !!(main_~c~0 > 0); 117#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 118#L15-2 assume !!(main_~c~0 > 0); 125#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 123#L15-2 [2019-11-28 02:56:23,731 INFO L796 eck$LassoCheckResult]: Loop: 123#L15-2 assume !!(main_~c~0 > 0); 124#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 123#L15-2 [2019-11-28 02:56:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,732 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-28 02:56:23,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431947601] [2019-11-28 02:56:23,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-28 02:56:23,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092471220] [2019-11-28 02:56:23,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-28 02:56:23,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:23,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141010788] [2019-11-28 02:56:23,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:23,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:23,819 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:23,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:23,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:23,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:23,820 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:23,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:23,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:23,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-11-28 02:56:23,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:23,821 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:23,825 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:56:23,828 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:56:23,835 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:56:23,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:23,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:23,936 INFO L404 LassoAnalysis]: Checking for nontermination... 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:56:23,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:23,948 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:56:23,954 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:23,954 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:23,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:23,971 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:23,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:23,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:24,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:24,003 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:24,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:24,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:24,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:24,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:24,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,005 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:24,005 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:24,005 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-11-28 02:56:24,005 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:24,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:24,008 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:56:24,029 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:56:24,038 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:56:24,056 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:56:24,232 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:24,232 INFO L489 LassoAnalysis]: Using template 'affine'. 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:56:24,250 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:56:24,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:24,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:24,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:24,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:24,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:24,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:24,258 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:56:24,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:24,266 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:24,266 INFO L444 ModelExtractionUtils]: 0 out of 3 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:24,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:24,281 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:24,281 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:24,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 02:56:24,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,350 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,365 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:56:24,366 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:24,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:56:24,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-28 02:56:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:56:24,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:56:24,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,387 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,419 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,430 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:56:24,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:24,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:56:24,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-28 02:56:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 02:56:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:56:24,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,448 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,477 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,487 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:56:24,488 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:24,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:56:24,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-11-28 02:56:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:24,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 02:56:24,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 02:56:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:56:24,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-28 02:56:24,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:56:24,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-28 02:56:24,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 02:56:24,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:56:24,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-28 02:56:24,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:24,509 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:56:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-28 02:56:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-28 02:56:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:56:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-28 02:56:24,511 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 02:56:24,511 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 02:56:24,511 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:56:24,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-28 02:56:24,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:56:24,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:24,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:24,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:56:24,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:24,512 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 265#L15-2 [2019-11-28 02:56:24,512 INFO L796 eck$LassoCheckResult]: Loop: 265#L15-2 assume !!(main_~c~0 > 0); 264#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 265#L15-2 [2019-11-28 02:56:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:56:24,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:24,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472902985] [2019-11-28 02:56:24,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-28 02:56:24,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:24,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456010603] [2019-11-28 02:56:24,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-28 02:56:24,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:24,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59302280] [2019-11-28 02:56:24,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:24,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:24,576 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:24,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:24,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:24,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:24,576 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:24,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:24,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:24,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-11-28 02:56:24,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:24,577 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:24,579 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:56:24,582 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:56:24,588 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:56:24,594 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:56:24,644 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:24,644 INFO L404 LassoAnalysis]: Checking for nontermination... 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:56:24,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:24,653 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:24,662 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:24,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:24,685 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 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 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:56:24,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:24,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:24,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:24,718 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [0, 1, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:24,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:24,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:24,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:24,744 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:24,757 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:24,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:24,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:24,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:24,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:24,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:24,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:24,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-11-28 02:56:24,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:24,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:24,760 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:56:24,768 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:56:24,774 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:56:24,777 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:56:24,829 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:24,830 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:24,874 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:56:24,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:24,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:24,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:24,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:24,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:24,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:24,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:24,886 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 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:56:24,894 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:56:24,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:24,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:24,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:24,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:24,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:24,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:24,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:24,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:24,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:24,904 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:24,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:24,909 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:24,909 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:24,909 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-11-28 02:56:24,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:24,940 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:24,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:24,941 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:56:24,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:56:24,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-28 02:56:24,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-11-28 02:56:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-28 02:56:24,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 02:56:24,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 02:56:24,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:56:24,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:24,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-28 02:56:24,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:56:24,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-28 02:56:24,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 02:56:24,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-28 02:56:24,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-28 02:56:24,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:24,959 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 02:56:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-28 02:56:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 02:56:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-28 02:56:24,962 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 02:56:24,962 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 02:56:24,962 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:56:24,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-28 02:56:24,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:56:24,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:24,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:24,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-28 02:56:24,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:24,965 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 314#L15-2 assume !!(main_~c~0 > 0); 315#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 316#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-11-28 02:56:24,965 INFO L796 eck$LassoCheckResult]: Loop: 309#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 310#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-11-28 02:56:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-28 02:56:24,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:24,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424636101] [2019-11-28 02:56:24,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424636101] [2019-11-28 02:56:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:56:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:56:25,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206020667] [2019-11-28 02:56:25,038 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-28 02:56:25,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:25,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136449834] [2019-11-28 02:56:25,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:25,083 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:25,083 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:25,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:25,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:25,083 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:25,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:25,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:25,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-11-28 02:56:25,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:25,084 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:25,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:25,092 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:56:25,098 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:56:25,100 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:56:25,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:25,151 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:25,162 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:25,174 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,191 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:25,191 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 15, 7] Nus: [1, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:25,196 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:25,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:25,213 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:25,216 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:25,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:25,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:25,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:25,216 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:25,216 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,216 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:25,216 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:25,216 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-11-28 02:56:25,216 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:25,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:25,218 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:56:25,228 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:56:25,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:25,237 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:56:25,291 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:25,292 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,303 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:56:25,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:25,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:25,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:25,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:25,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:25,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:25,309 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:56:25,312 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,324 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:56:25,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:25,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:25,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:25,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:25,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:25,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:25,335 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,342 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:56:25,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:25,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:25,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:25,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:25,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:25,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:25,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:25,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:25,352 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,356 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:25,357 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:25,357 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:25,357 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-11-28 02:56:25,359 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,382 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,410 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:56:25,411 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:25,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:56:25,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-11-28 02:56:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:56:25,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:56:25,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,428 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,454 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,473 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:56:25,474 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:25,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:56:25,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-28 02:56:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:25,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:56:25,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,497 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,525 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,540 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:56:25,540 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:25,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 02:56:25,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-11-28 02:56:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 02:56:25,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:56:25,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 02:56:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 02:56:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 02:56:25,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:56:25,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-28 02:56:25,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:56:25,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:56:25,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 02:56:25,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:25,557 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 02:56:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 02:56:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-28 02:56:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 02:56:25,558 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 02:56:25,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:56:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:56:25,562 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-28 02:56:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:25,580 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-28 02:56:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:56:25,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-28 02:56:25,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:56:25,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-28 02:56:25,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:56:25,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:56:25,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-28 02:56:25,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:25,584 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-28 02:56:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-28 02:56:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-28 02:56:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-28 02:56:25,586 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 02:56:25,586 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 02:56:25,586 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:56:25,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-28 02:56:25,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:56:25,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:25,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:25,587 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-28 02:56:25,587 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 02:56:25,587 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 463#L15-2 assume !!(main_~c~0 > 0); 461#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-11-28 02:56:25,588 INFO L796 eck$LassoCheckResult]: Loop: 459#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-11-28 02:56:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-28 02:56:25,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:25,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615986720] [2019-11-28 02:56:25,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-28 02:56:25,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:25,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645916408] [2019-11-28 02:56:25,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-28 02:56:25,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:25,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944006785] [2019-11-28 02:56:25,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:25,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:25,661 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:25,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:25,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:25,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:25,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:25,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,662 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:25,662 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:25,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-11-28 02:56:25,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:25,662 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:25,663 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:56:25,670 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:56:25,672 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:56:25,674 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:56:25,727 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:25,728 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:25,736 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:25,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:25,754 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,762 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:25,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:25,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:25,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:25,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:25,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:25,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:25,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:25,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-11-28 02:56:25,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:25,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:25,766 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:56:25,774 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:56:25,777 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:56:25,782 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:56:25,838 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:25,839 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:25,850 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:56:25,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:25,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:25,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:25,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:25,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:25,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:25,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:25,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:25,859 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:25,859 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:25,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:25,863 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:25,863 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:25,863 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2019-11-28 02:56:25,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:25,931 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:56:25,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:56:25,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-11-28 02:56:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:56:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:56:25,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:56:25,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:25,947 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:25,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:25,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,004 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:56:26,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:56:26,021 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-11-28 02:56:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:56:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:26,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:56:26,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,023 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,083 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:56:26,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:56:26,091 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-11-28 02:56:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:56:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 02:56:26,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:56:26,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,093 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,138 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:56:26,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:56:26,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-11-28 02:56:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:56:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:26,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:56:26,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,158 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,215 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:56:26,217 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 02:56:26,286 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-11-28 02:56:26,286 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:56:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:56:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 02:56:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:56:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 02:56:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 02:56:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-28 02:56:26,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:56:26,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-28 02:56:26,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 02:56:26,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 02:56:26,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-28 02:56:26,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:26,295 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-28 02:56:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-28 02:56:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-28 02:56:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:56:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-28 02:56:26,300 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 02:56:26,300 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 02:56:26,300 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:56:26,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-28 02:56:26,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:56:26,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:26,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:26,302 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-28 02:56:26,302 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 02:56:26,303 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 828#L15-2 assume !!(main_~c~0 > 0); 825#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-11-28 02:56:26,303 INFO L796 eck$LassoCheckResult]: Loop: 823#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-11-28 02:56:26,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-28 02:56:26,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:26,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242021567] [2019-11-28 02:56:26,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:56:26,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242021567] [2019-11-28 02:56:26,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041320360] [2019-11-28 02:56:26,353 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:56:26,379 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 02:56:26,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:26,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:56:26,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:26,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:56:26,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802325997] [2019-11-28 02:56:26,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-28 02:56:26,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:26,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550024720] [2019-11-28 02:56:26,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:26,479 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:26,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:26,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:26,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:26,479 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:26,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:26,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:26,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:26,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-11-28 02:56:26,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:26,480 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:26,481 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:56:26,485 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:56:26,492 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:56:26,496 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:56:26,554 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:26,554 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 02:56:26,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:26,571 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:26,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:26,576 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=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) [2019-11-28 02:56:26,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:26,583 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:26,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:26,599 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:26,673 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:26,674 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:26,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:26,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:26,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:26,675 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:26,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:26,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:26,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:26,675 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-11-28 02:56:26,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:26,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:26,676 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:56:26,678 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:56:26,684 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:56:26,689 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:56:26,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:26,743 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:56:26,748 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:56:26,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:26,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:26,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:26,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:26,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:26,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:26,755 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:56:26,762 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:56:26,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:26,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:26,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:26,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:26,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:26,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:26,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:26,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:26,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:26,768 INFO L444 ModelExtractionUtils]: 0 out of 3 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:26,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:26,772 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:26,772 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:26,773 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 02:56:26,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:56:26,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:56:26,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 02:56:26,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 65 states and 87 transitions. Complement of second has 9 states. [2019-11-28 02:56:26,865 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:56:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:56:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 02:56:26,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-28 02:56:26,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 02:56:26,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-28 02:56:26,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:26,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2019-11-28 02:56:26,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:56:26,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2019-11-28 02:56:26,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 02:56:26,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-28 02:56:26,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-11-28 02:56:26,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:26,870 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-11-28 02:56:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-11-28 02:56:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-11-28 02:56:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:56:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2019-11-28 02:56:26,875 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-11-28 02:56:26,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:56:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:56:26,876 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2019-11-28 02:56:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:26,892 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-11-28 02:56:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:56:26,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-11-28 02:56:26,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:56:26,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2019-11-28 02:56:26,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 02:56:26,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 02:56:26,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-28 02:56:26,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:26,895 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-28 02:56:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-28 02:56:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-11-28 02:56:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:56:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-28 02:56:26,898 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:56:26,898 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:56:26,898 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:56:26,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-28 02:56:26,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:56:26,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:26,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:26,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-28 02:56:26,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 02:56:26,900 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1096#L15-2 assume !!(main_~c~0 > 0); 1111#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1108#L15-2 assume !!(main_~c~0 > 0); 1101#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-11-28 02:56:26,900 INFO L796 eck$LassoCheckResult]: Loop: 1091#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-11-28 02:56:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-28 02:56:26,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:26,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929288518] [2019-11-28 02:56:26,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-28 02:56:26,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:26,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986441953] [2019-11-28 02:56:26,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:26,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-28 02:56:26,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:26,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711890679] [2019-11-28 02:56:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:26,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711890679] [2019-11-28 02:56:26,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865734100] [2019-11-28 02:56:26,998 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:56:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:56:27,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:27,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-28 02:56:27,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708943515] [2019-11-28 02:56:27,166 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:27,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:27,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:27,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:27,167 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:27,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:27,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:27,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-11-28 02:56:27,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:27,167 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:27,168 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:56:27,172 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:56:27,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:56:27,183 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:56:27,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:27,234 INFO L404 LassoAnalysis]: Checking for nontermination... 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:56:27,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:27,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:27,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:27,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:27,252 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:27,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:27,260 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:27,335 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:27,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:27,336 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:27,336 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:27,336 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:27,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,336 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:27,336 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:27,336 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-11-28 02:56:27,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:27,337 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:27,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:27,340 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:56:27,346 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:56:27,353 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:56:27,410 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:27,410 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,415 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:56:27,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:27,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:27,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:27,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:27,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:27,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:27,423 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,430 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:56:27,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:27,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:27,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:27,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:27,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:27,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:27,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:27,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:27,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:27,442 INFO L444 ModelExtractionUtils]: 0 out of 3 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:27,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:27,447 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:27,447 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:27,447 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:56:27,449 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:27,536 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:56:27,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:56:27,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-28 02:56:27,568 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:56:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:56:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:56:27,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:56:27,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:27,569 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:27,626 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:56:27,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:56:27,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-28 02:56:27,649 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:56:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:56:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:56:27,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:56:27,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:27,650 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:56:27,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:27,692 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:56:27,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:56:27,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-11-28 02:56:27,736 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:56:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:56:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 02:56:27,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:56:27,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:27,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 02:56:27,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:27,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 02:56:27,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:27,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-28 02:56:27,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-28 02:56:27,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-28 02:56:27,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:56:27,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:56:27,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-28 02:56:27,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:27,741 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 02:56:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-28 02:56:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-28 02:56:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:56:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 02:56:27,745 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 02:56:27,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:56:27,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:56:27,746 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-28 02:56:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:27,934 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-28 02:56:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:56:27,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-28 02:56:27,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-28 02:56:27,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-28 02:56:27,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:56:27,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:56:27,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-28 02:56:27,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:27,940 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-28 02:56:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-28 02:56:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-28 02:56:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:56:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 02:56:27,945 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 02:56:27,945 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 02:56:27,945 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:56:27,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 02:56:27,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:56:27,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:27,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:27,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:27,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-28 02:56:27,947 INFO L794 eck$LassoCheckResult]: Stem: 1739#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1741#L15-2 assume !!(main_~c~0 > 0); 1755#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1752#L15-2 assume !!(main_~c~0 > 0); 1746#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1742#L15-2 [2019-11-28 02:56:27,947 INFO L796 eck$LassoCheckResult]: Loop: 1742#L15-2 assume !!(main_~c~0 > 0); 1743#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1745#L15-2 assume !!(main_~c~0 > 0); 1751#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1750#L15-2 assume !!(main_~c~0 > 0); 1735#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1736#L15-2 assume !!(main_~c~0 > 0); 1746#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1742#L15-2 [2019-11-28 02:56:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-28 02:56:27,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:27,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161031352] [2019-11-28 02:56:27,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:27,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-28 02:56:27,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:27,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31366535] [2019-11-28 02:56:27,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:56:27,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31366535] [2019-11-28 02:56:27,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:56:27,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:56:27,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458803199] [2019-11-28 02:56:27,981 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:56:27,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:27,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:56:27,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:56:27,981 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-28 02:56:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:27,990 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-28 02:56:27,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:56:27,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-28 02:56:27,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:56:27,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-28 02:56:27,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:56:27,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:56:27,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-28 02:56:27,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:27,992 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-28 02:56:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-28 02:56:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-28 02:56:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:56:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-28 02:56:27,995 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 02:56:27,995 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 02:56:27,995 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:56:27,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-28 02:56:27,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:56:27,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:27,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:27,996 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:27,997 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-28 02:56:27,997 INFO L794 eck$LassoCheckResult]: Stem: 1830#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1832#L15-2 assume !!(main_~c~0 > 0); 1846#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1845#L15-2 assume !!(main_~c~0 > 0); 1838#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1833#L15-2 [2019-11-28 02:56:27,997 INFO L796 eck$LassoCheckResult]: Loop: 1833#L15-2 assume !!(main_~c~0 > 0); 1834#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1836#L15-2 assume !!(main_~c~0 > 0); 1843#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1840#L15-2 assume !!(main_~c~0 > 0); 1826#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1827#L15-2 assume !!(main_~c~0 > 0); 1844#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1841#L15-2 assume !!(main_~c~0 > 0); 1837#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1833#L15-2 [2019-11-28 02:56:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-28 02:56:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:27,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001985890] [2019-11-28 02:56:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-28 02:56:28,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:28,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250926392] [2019-11-28 02:56:28,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,037 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-28 02:56:28,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:28,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311550816] [2019-11-28 02:56:28,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:28,162 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:28,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:28,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:28,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:28,163 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:28,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:28,164 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:28,164 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-11-28 02:56:28,164 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:28,164 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:28,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:56:28,169 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:56:28,187 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:56:28,192 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:56:28,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:28,235 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:28,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:28,246 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,250 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:28,251 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:28,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:28,258 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 56 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:28,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:28,268 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,274 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:28,276 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:28,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:28,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:28,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:28,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:28,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:28,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:28,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-11-28 02:56:28,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:28,277 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:28,278 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:56:28,281 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:56:28,288 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:56:28,293 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:56:28,334 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:28,334 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,340 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:56:28,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:28,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:28,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:28,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:28,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:28,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:28,346 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,351 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:56:28,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:28,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:28,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:28,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:28,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:28,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:28,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:28,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:28,363 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:56:28,363 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:28,371 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:28,371 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:28,371 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:28,371 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 02:56:28,373 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:28,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:56:28,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:56:28,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-28 02:56:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:28,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:56:28,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,471 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:28,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:56:28,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:56:28,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-28 02:56:28,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:28,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:56:28,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,550 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:28,610 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:56:28,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:56:28,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-11-28 02:56:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:28,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:56:28,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,628 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:28,686 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:56:28,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:56:28,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-11-28 02:56:28,732 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:56:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:56:28,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:56:28,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,733 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:28,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:28,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:28,807 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:56:28,808 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 02:56:28,861 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,861 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,861 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:28,905 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-11-28 02:56:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:56:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-28 02:56:28,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 02:56:28,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-28 02:56:28,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-28 02:56:28,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:28,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-28 02:56:28,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 02:56:28,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-28 02:56:28,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 02:56:28,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:56:28,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-28 02:56:28,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:28,920 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-28 02:56:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-28 02:56:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-28 02:56:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:56:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-28 02:56:28,927 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 02:56:28,927 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 02:56:28,927 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:56:28,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-28 02:56:28,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:56:28,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:28,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:28,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:28,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-28 02:56:28,930 INFO L794 eck$LassoCheckResult]: Stem: 2823#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 2826#L15-2 assume !!(main_~c~0 > 0); 2850#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2846#L15-2 assume !!(main_~c~0 > 0); 2832#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2828#L15-2 [2019-11-28 02:56:28,930 INFO L796 eck$LassoCheckResult]: Loop: 2828#L15-2 assume !!(main_~c~0 > 0); 2829#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2881#L15-2 assume !!(main_~c~0 > 0); 2874#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2872#L15-2 assume !!(main_~c~0 > 0); 2866#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2865#L15-2 assume !!(main_~c~0 > 0); 2864#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2856#L15-2 assume !!(main_~c~0 > 0); 2835#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2847#L15-2 assume !!(main_~c~0 > 0); 2845#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2843#L15-2 assume !!(main_~c~0 > 0); 2831#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2828#L15-2 [2019-11-28 02:56:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-28 02:56:28,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:28,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421573109] [2019-11-28 02:56:28,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-28 02:56:28,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:28,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974508632] [2019-11-28 02:56:28,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-28 02:56:28,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:28,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94731152] [2019-11-28 02:56:28,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:28,971 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:29,094 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-28 02:56:29,111 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:29,111 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:29,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:29,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:29,112 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:29,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:29,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:29,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-11-28 02:56:29,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:29,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:29,114 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:56:29,121 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:56:29,123 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:56:29,126 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:56:29,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:29,176 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:29,184 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:29,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:29,193 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,200 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:29,202 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:29,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:29,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:29,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:29,202 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:29,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:29,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:29,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-11-28 02:56:29,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:29,203 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:29,203 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:56:29,206 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:56:29,208 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:56:29,213 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:56:29,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:29,270 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:29,275 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:56:29,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:29,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:29,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:29,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:29,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:29,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,283 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:29,290 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:56:29,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:29,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:29,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:29,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:29,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:29,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,298 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:29,304 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:56:29,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:29,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:29,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:29,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:29,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:29,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:29,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:29,311 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:56:29,312 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:29,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:29,315 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:29,315 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:29,315 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 02:56:29,317 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:29,419 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:56:29,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:56:29,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-28 02:56:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:56:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:29,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:56:29,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:29,426 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:29,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:56:29,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:56:29,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-28 02:56:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:56:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:29,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:56:29,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:29,536 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:29,643 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 7 loop predicates [2019-11-28 02:56:29,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:56:29,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-11-28 02:56:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:56:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:29,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:56:29,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:29,652 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:29,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:56:29,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:56:29,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-11-28 02:56:29,805 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:56:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:56:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:56:29,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:56:29,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:29,806 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:29,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:29,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:29,902 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:56:29,903 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 02:56:29,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:29,976 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,040 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,055 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,055 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,115 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,116 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,116 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,116 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,117 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,117 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,117 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,117 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,118 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,119 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,119 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,119 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,121 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,122 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,122 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:30,161 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-11-28 02:56:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:56:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-28 02:56:30,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 02:56:30,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:30,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-28 02:56:30,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:30,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-28 02:56:30,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:30,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-28 02:56:30,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 02:56:30,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-28 02:56:30,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:30,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 02:56:30,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-28 02:56:30,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:30,198 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-28 02:56:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-28 02:56:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-28 02:56:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-28 02:56:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-28 02:56:30,235 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 02:56:30,235 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 02:56:30,235 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:56:30,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-28 02:56:30,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 02:56:30,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:30,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:30,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:30,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-28 02:56:30,239 INFO L794 eck$LassoCheckResult]: Stem: 5736#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 5744#L15-2 assume !!(main_~c~0 > 0); 5778#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5754#L15-2 assume !!(main_~c~0 > 0); 5750#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5745#L15-2 [2019-11-28 02:56:30,240 INFO L796 eck$LassoCheckResult]: Loop: 5745#L15-2 assume !!(main_~c~0 > 0); 5746#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5951#L15-2 assume !!(main_~c~0 > 0); 5901#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5891#L15-2 assume !!(main_~c~0 > 0); 5887#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5884#L15-2 assume !!(main_~c~0 > 0); 5881#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5867#L15-2 assume !!(main_~c~0 > 0); 5866#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5857#L15-2 assume !!(main_~c~0 > 0); 5838#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5839#L15-2 assume !!(main_~c~0 > 0); 5753#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5776#L15-2 assume !!(main_~c~0 > 0); 5755#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5752#L15-2 assume !!(main_~c~0 > 0); 5749#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5745#L15-2 [2019-11-28 02:56:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-28 02:56:30,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:30,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646483101] [2019-11-28 02:56:30,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-28 02:56:30,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:30,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905407036] [2019-11-28 02:56:30,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-28 02:56:30,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:30,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741073624] [2019-11-28 02:56:30,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:30,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:30,511 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-28 02:56:30,526 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:30,527 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:30,527 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:30,527 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:30,527 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:30,527 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,527 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:30,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:30,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-11-28 02:56:30,528 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:30,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:30,529 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:56:30,533 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:56:30,540 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:56:30,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:30,594 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:30,594 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:30,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:30,638 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,643 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:30,644 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:30,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:30,656 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 68 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:30,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:30,665 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,672 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:30,675 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:30,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:30,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:30,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:30,675 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:30,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:30,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:30,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-11-28 02:56:30,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:30,676 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:30,677 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:56:30,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:56:30,684 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:56:30,692 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:56:30,740 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:30,740 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,744 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:56:30,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:30,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:30,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:30,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:30,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:30,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:30,752 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,758 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:56:30,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:30,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:30,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:30,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:30,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:30,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:30,765 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,771 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:56:30,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:30,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:30,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:30,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:30,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:30,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:30,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:30,776 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:30,779 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:30,779 INFO L444 ModelExtractionUtils]: 0 out of 3 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:30,784 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:30,784 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:30,784 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:30,784 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:56:30,786 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:30,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:30,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:30,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:56:30,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:30,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:56:30,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-28 02:56:30,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-28 02:56:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:30,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:56:30,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:30,929 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:30,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:30,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:30,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:56:30,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:31,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:56:31,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-28 02:56:31,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-28 02:56:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:31,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:56:31,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,062 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:31,201 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 9 loop predicates [2019-11-28 02:56:31,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-28 02:56:31,210 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 392 states and 537 transitions. Complement of second has 4 states. [2019-11-28 02:56:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:31,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:56:31,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,212 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:31,364 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:56:31,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-28 02:56:31,402 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 455 states and 606 transitions. Complement of second has 8 states. [2019-11-28 02:56:31,403 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:56:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:56:31,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:56:31,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,404 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:31,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:56:31,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:31,535 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:56:31,535 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-28 02:56:31,596 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,597 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,597 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,599 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,599 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,601 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,601 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,602 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,602 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,606 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,606 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,606 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,606 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,660 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,660 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,660 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,665 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,665 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,668 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,668 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,671 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,671 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,671 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,673 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,673 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,673 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,673 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,674 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,719 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,720 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,720 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,722 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,722 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,722 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,723 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,723 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,723 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,724 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,724 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,725 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,725 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,725 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,725 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,726 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,726 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,726 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,726 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,728 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,730 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,730 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,730 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,730 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,734 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,734 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,734 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,736 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,736 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,736 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,743 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,743 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,839 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:31,870 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. Result 5484 states and 8953 transitions. Complement of second has 178 states 20 powerset states158 rank states. The highest rank that occured is 7 [2019-11-28 02:56:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:56:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2019-11-28 02:56:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 02:56:31,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-28 02:56:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-28 02:56:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:31,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2019-11-28 02:56:31,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 02:56:31,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2019-11-28 02:56:31,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 02:56:31,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 02:56:31,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2019-11-28 02:56:31,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:31,937 INFO L688 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2019-11-28 02:56:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2019-11-28 02:56:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2019-11-28 02:56:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-28 02:56:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2019-11-28 02:56:31,957 INFO L711 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-11-28 02:56:31,957 INFO L591 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-11-28 02:56:31,957 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:56:31,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2019-11-28 02:56:31,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 02:56:31,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:31,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:31,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:31,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2019-11-28 02:56:31,963 INFO L794 eck$LassoCheckResult]: Stem: 13489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 13504#L15-2 assume !!(main_~c~0 > 0); 13615#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13513#L15-2 assume !!(main_~c~0 > 0); 13510#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13506#L15-2 [2019-11-28 02:56:31,964 INFO L796 eck$LassoCheckResult]: Loop: 13506#L15-2 assume !!(main_~c~0 > 0); 13507#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 14139#L15-2 assume !!(main_~c~0 > 0); 14003#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 14001#L15-2 assume !!(main_~c~0 > 0); 13999#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13997#L15-2 assume !!(main_~c~0 > 0); 13995#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13991#L15-2 assume !!(main_~c~0 > 0); 13989#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13987#L15-2 assume !!(main_~c~0 > 0); 13983#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13984#L15-2 assume !!(main_~c~0 > 0); 13969#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13797#L15-2 assume !!(main_~c~0 > 0); 13967#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13968#L15-2 assume !!(main_~c~0 > 0); 13515#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13517#L15-2 assume !!(main_~c~0 > 0); 13516#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13514#L15-2 assume !!(main_~c~0 > 0); 13512#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13506#L15-2 [2019-11-28 02:56:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2019-11-28 02:56:31,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:31,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417278090] [2019-11-28 02:56:31,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:31,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2019-11-28 02:56:31,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:31,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442444047] [2019-11-28 02:56:31,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:31,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2019-11-28 02:56:32,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:32,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165445895] [2019-11-28 02:56:32,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:32,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:32,235 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-11-28 02:56:32,262 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:32,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:32,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:32,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:32,262 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:32,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:32,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:32,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-11-28 02:56:32,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:32,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:32,264 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:56:32,266 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:56:32,270 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:56:32,276 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:56:32,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:32,333 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:32,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:32,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:32,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:32,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:32,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:56:32,352 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:32,358 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:32,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:32,372 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:32,374 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:32,374 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:32,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:32,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:32,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:32,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:32,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:32,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-11-28 02:56:32,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:32,374 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:32,375 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:56:32,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:32,379 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:56:32,387 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:56:32,445 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:32,446 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,451 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:56:32,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:32,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:32,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:32,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:32,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:32,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:32,458 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,464 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:56:32,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:32,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:32,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:32,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:32,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:32,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:32,475 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:32,481 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:32,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:32,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:32,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:32,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:32,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:32,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:32,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:32,489 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:56:32,490 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:32,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:32,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:32,493 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:32,493 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:56:32,495 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:32,658 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:56:32,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-28 02:56:32,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-11-28 02:56:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:56:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:32,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-28 02:56:32,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:32,669 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:32,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:56:32,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-28 02:56:32,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-11-28 02:56:32,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:56:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:32,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-28 02:56:32,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:32,820 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:32,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:56:32,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:32,978 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 11 loop predicates [2019-11-28 02:56:32,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-28 02:56:32,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 996 states and 1456 transitions. Complement of second has 4 states. [2019-11-28 02:56:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:56:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:56:32,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-28 02:56:32,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:32,996 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:33,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:33,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:33,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:56:33,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:33,157 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:56:33,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-28 02:56:33,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 1149 states and 1623 transitions. Complement of second has 8 states. [2019-11-28 02:56:33,203 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:56:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:56:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 02:56:33,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-28 02:56:33,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:33,204 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:33,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:33,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:33,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:56:33,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:33,362 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:56:33,362 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-28 02:56:33,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,431 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,431 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,432 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,432 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,432 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,445 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,445 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,445 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,445 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,446 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,446 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,446 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,449 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,449 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,450 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,450 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,450 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,525 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,538 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,538 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,538 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,538 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,538 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,539 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,539 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,539 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,539 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,540 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,540 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,541 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,541 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,541 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,542 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,543 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,543 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,543 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,543 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,544 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,544 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,544 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,545 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,545 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,545 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,545 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,546 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,547 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,547 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,547 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,548 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,548 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,548 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,549 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,549 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,616 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,616 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,616 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,631 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,631 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,631 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,632 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,634 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,635 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,635 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,635 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,635 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,637 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,637 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,637 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,637 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,644 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,644 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,644 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,644 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,648 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,658 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,659 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,659 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,659 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,659 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,660 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,661 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,665 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,665 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,757 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,757 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,757 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,758 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,759 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,759 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,759 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,759 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,759 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,760 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,760 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,760 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,761 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,761 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,761 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,762 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,762 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,766 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,766 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,766 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,766 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,767 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,767 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,767 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,767 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,769 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,769 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,769 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,771 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,771 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,772 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,772 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,772 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,772 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,773 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,773 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,773 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,775 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,775 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,777 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,777 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,777 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,779 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,784 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,785 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,786 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,787 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,788 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,788 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,788 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,788 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,789 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,789 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,789 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,789 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,789 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,790 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,790 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,790 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,790 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,791 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,791 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,791 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,791 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,791 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,792 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,792 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,792 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,794 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,794 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,794 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,795 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,795 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,795 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,795 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,796 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,796 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,804 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,805 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,805 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,805 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,805 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,806 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,806 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,806 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,807 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,807 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,807 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,892 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,892 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,892 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,893 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,893 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,893 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,893 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,894 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,894 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,894 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,895 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,895 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,896 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,897 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,898 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,898 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,898 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,898 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,899 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,900 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,900 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,900 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,900 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,901 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,901 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,902 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,903 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,903 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,903 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,903 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,904 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,904 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,904 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,905 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,906 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,906 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,909 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,929 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,929 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,929 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,929 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,930 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,930 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 02:56:33,967 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. Result 14845 states and 25888 transitions. Complement of second has 212 states 24 powerset states188 rank states. The highest rank that occured is 7 [2019-11-28 02:56:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:56:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2019-11-28 02:56:33,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-28 02:56:33,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:33,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2019-11-28 02:56:33,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:33,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2019-11-28 02:56:33,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:33,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2019-11-28 02:56:34,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-28 02:56:34,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2019-11-28 02:56:34,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 02:56:34,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:56:34,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2019-11-28 02:56:34,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:56:34,142 INFO L688 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2019-11-28 02:56:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2019-11-28 02:56:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2019-11-28 02:56:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-11-28 02:56:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2019-11-28 02:56:34,192 INFO L711 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-11-28 02:56:34,192 INFO L591 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-11-28 02:56:34,192 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 02:56:34,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2019-11-28 02:56:34,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-28 02:56:34,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:34,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:34,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 02:56:34,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2019-11-28 02:56:34,200 INFO L794 eck$LassoCheckResult]: Stem: 33239#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 33240#L15-2 assume !!(main_~c~0 > 0); 33455#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33279#L15-2 assume !!(main_~c~0 > 0); 33276#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33272#L15-2 [2019-11-28 02:56:34,200 INFO L796 eck$LassoCheckResult]: Loop: 33272#L15-2 assume !!(main_~c~0 > 0); 33273#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34829#L15-2 assume !!(main_~c~0 > 0); 34179#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34178#L15-2 assume !!(main_~c~0 > 0); 34177#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34176#L15-2 assume !!(main_~c~0 > 0); 34175#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34174#L15-2 assume !!(main_~c~0 > 0); 34173#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34172#L15-2 assume !!(main_~c~0 > 0); 34171#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34170#L15-2 assume !!(main_~c~0 > 0); 34169#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34133#L15-2 assume !!(main_~c~0 > 0); 34168#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34167#L15-2 assume !!(main_~c~0 > 0); 34166#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33612#L15-2 assume !!(main_~c~0 > 0); 34165#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34163#L15-2 assume !!(main_~c~0 > 0); 33281#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33283#L15-2 assume !!(main_~c~0 > 0); 33282#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 33280#L15-2 assume !!(main_~c~0 > 0); 33278#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33272#L15-2 [2019-11-28 02:56:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2019-11-28 02:56:34,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:34,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813420946] [2019-11-28 02:56:34,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2019-11-28 02:56:34,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:34,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599093451] [2019-11-28 02:56:34,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2019-11-28 02:56:34,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:34,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119805018] [2019-11-28 02:56:34,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:34,237 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:34,542 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-11-28 02:56:34,554 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:34,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:34,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:34,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:34,555 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:56:34,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:34,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:34,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-11-28 02:56:34,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:34,556 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:34,557 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:56:34,561 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:56:34,567 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:56:34,570 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:56:34,635 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:34,635 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:34,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:56:34,644 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:56:34,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:56:34,693 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:56:34,695 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:34,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:34,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:34,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:34,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:34,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:34,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:34,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-11-28 02:56:34,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:34,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:34,697 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:56:34,699 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:56:34,707 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:56:34,714 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:56:34,765 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:34,765 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,769 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:56:34,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:34,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:34,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:34,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:34,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:34,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:34,777 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,783 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:56:34,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:34,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:34,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:34,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:34,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:34,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:34,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:34,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:34,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:56:34,795 INFO L444 ModelExtractionUtils]: 0 out of 3 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:34,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:56:34,800 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:56:34,800 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:34,800 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 02:56:34,802 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:56:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:34,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:34,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:34,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:56:34,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:56:34,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 02:56:34,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-28 02:56:34,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-11-28 02:56:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:34,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-28 02:56:34,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:34,923 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:34,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:34,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:34,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:56:34,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:56:34,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 02:56:34,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-28 02:56:35,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-11-28 02:56:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 02:56:35,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-28 02:56:35,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:35,013 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:35,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:35,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:35,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:56:35,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:56:35,099 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 6 loop predicates [2019-11-28 02:56:35,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-28 02:56:35,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 2364 states and 3787 transitions. Complement of second has 7 states. [2019-11-28 02:56:35,147 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:56:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-28 02:56:35,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-28 02:56:35,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:35,148 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:56:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:35,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:35,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:35,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:56:35,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:56:35,247 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 02:56:35,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-28 02:56:35,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 3111 states and 5286 transitions. Complement of second has 12 states. [2019-11-28 02:56:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-28 02:56:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-28 02:56:35,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2019-11-28 02:56:35,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:35,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2019-11-28 02:56:35,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:35,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2019-11-28 02:56:35,333 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:56:35,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2019-11-28 02:56:35,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 02:56:35,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 02:56:35,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 02:56:35,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:35,335 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:56:35,335 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:56:35,335 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:56:35,335 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 02:56:35,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:56:35,336 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:56:35,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 02:56:35,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:56:35 BoogieIcfgContainer [2019-11-28 02:56:35,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:56:35,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:56:35,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:56:35,346 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:56:35,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:22" (3/4) ... [2019-11-28 02:56:35,353 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:56:35,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:56:35,356 INFO L168 Benchmark]: Toolchain (without parser) took 13874.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 952.3 MB in the beginning and 814.3 MB in the end (delta: 138.1 MB). Peak memory consumption was 516.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:35,356 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:56:35,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:35,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:35,359 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:56:35,359 INFO L168 Benchmark]: RCFGBuilder took 215.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:35,360 INFO L168 Benchmark]: BuchiAutomizer took 13227.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 814.3 MB in the end (delta: 287.1 MB). Peak memory consumption was 535.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:35,360 INFO L168 Benchmark]: Witness Printer took 8.67 ms. Allocated memory is still 1.4 GB. Free memory is still 814.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:56:35,362 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13227.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 814.3 MB in the end (delta: 287.1 MB). Peak memory consumption was 535.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.67 ms. Allocated memory is still 1.4 GB. Free memory is still 814.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (4 trivial, 4 deterministic, 9 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One deterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 201 and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 6.3s. Construction of modules took 0.6s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 3227 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1604 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 3, 1, 5]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 254/414 HoareTripleCheckerStatistics: 208 SDtfs, 258 SDslu, 112 SDs, 0 SdLazy, 442 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT10 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf98 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp97 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...