./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer --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-cad4683 [2019-10-22 08:54:44,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:44,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:44,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:44,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:44,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:44,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:44,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:44,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:44,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:44,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:44,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:44,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:44,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:44,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:44,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:44,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:44,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:44,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:44,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:44,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:44,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:44,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:44,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:44,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:44,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:44,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:44,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:44,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:44,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:44,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:44,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:44,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:44,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:44,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:44,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:44,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:44,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:44,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:44,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:44,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:44,187 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:44,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:44,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:44,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:44,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:44,207 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:44,207 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:44,208 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:44,208 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:44,208 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:44,208 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:44,208 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:44,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:44,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:44,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:44,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:44,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:44,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:44,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:44,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:44,210 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:44,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:44,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:44,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:44,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:44,211 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:44,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:44,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:44,211 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:44,213 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:44,213 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer 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-10-22 08:54:44,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:44,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:44,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:44,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:44,265 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:44,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-10-22 08:54:44,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/data/c8ab8ce03/58b41e7f27614b08826d3a29ef603c85/FLAGf94fab73b [2019-10-22 08:54:44,640 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:44,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-10-22 08:54:44,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/data/c8ab8ce03/58b41e7f27614b08826d3a29ef603c85/FLAGf94fab73b [2019-10-22 08:54:44,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/data/c8ab8ce03/58b41e7f27614b08826d3a29ef603c85 [2019-10-22 08:54:44,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:44,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:44,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:44,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:44,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:44,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ddfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44, skipping insertion in model container [2019-10-22 08:54:44,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,671 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:44,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:44,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:44,817 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:44,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:44,923 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:44,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44 WrapperNode [2019-10-22 08:54:44,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:44,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:44,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:44,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:44,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:44,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:44,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:44,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:44,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... [2019-10-22 08:54:44,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:44,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:44,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:44,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:44,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:45,128 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:45,129 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:54:45,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:45 BoogieIcfgContainer [2019-10-22 08:54:45,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:45,130 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:45,130 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:45,134 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:45,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:45,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:44" (1/3) ... [2019-10-22 08:54:45,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18c76e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:45, skipping insertion in model container [2019-10-22 08:54:45,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:45,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:44" (2/3) ... [2019-10-22 08:54:45,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18c76e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:45, skipping insertion in model container [2019-10-22 08:54:45,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:45,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:45" (3/3) ... [2019-10-22 08:54:45,138 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2019-10-22 08:54:45,179 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:45,179 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:45,179 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:45,180 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:45,180 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:45,180 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:45,180 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:45,180 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:45,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-10-22 08:54:45,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:45,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:45,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:45,216 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:45,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-10-22 08:54:45,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:45,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:45,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:45,224 INFO L791 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-10-22 08:54:45,225 INFO L793 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-10-22 08:54:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 08:54:45,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374956416] [2019-10-22 08:54:45,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,321 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-10-22 08:54:45,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374646412] [2019-10-22 08:54:45,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-10-22 08:54:45,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522577] [2019-10-22 08:54:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,350 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,401 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:45,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:45,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:45,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:45,403 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:45,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:45,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:45,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:45,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-10-22 08:54:45,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:45,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:45,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:45,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:45,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:45,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-10-22 08:54:45,600 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:45,600 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:45,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:45,607 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:45,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:45,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:45,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:45,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:45,629 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:45,630 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:45,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:45,636 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:45,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:45,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:45,655 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:45,656 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:45,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:45,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:45,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:45,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:45,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:45,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:45,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:45,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-10-22 08:54:45,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:45,658 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:45,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:45,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-10-22 08:54:45,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-10-22 08:54:45,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:45,747 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:45,752 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:45,753 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-10-22 08:54:45,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:45,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:45,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:45,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:45,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:45,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:45,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:45,766 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-10-22 08:54:45,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:45,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:45,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:45,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:45,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:45,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:45,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:45,777 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-10-22 08:54:45,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:45,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:45,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:45,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:45,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:45,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:45,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:45,794 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:45,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:45,803 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:45,805 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:45,805 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:45,805 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:45,806 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:45,808 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:45,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:45,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:45,913 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-10-22 08:54:45,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-10-22 08:54:45,945 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-10-22 08:54:45,948 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-10-22 08:54:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:54:45,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-10-22 08:54:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-10-22 08:54:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:45,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-10-22 08:54:45,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:45,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-10-22 08:54:45,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:54:45,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-10-22 08:54:45,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-10-22 08:54:45,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:45,963 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-10-22 08:54:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:54:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-10-22 08:54:45,986 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:45,986 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:45,986 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:45,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-10-22 08:54:45,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:45,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:45,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:45,988 INFO L791 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-10-22 08:54:45,988 INFO L793 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-10-22 08:54:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-10-22 08:54:45,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737694993] [2019-10-22 08:54:45,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-10-22 08:54:46,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556440585] [2019-10-22 08:54:46,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,010 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-10-22 08:54:46,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888614015] [2019-10-22 08:54:46,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,022 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,039 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,039 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:46,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-10-22 08:54:46,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,138 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,138 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:46,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:46,152 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:46,152 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,158 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:46,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:46,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:46,171 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:46,172 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:46,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-10-22 08:54:46,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,231 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:46,232 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-10-22 08:54:46,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:46,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:46,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:46,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:46,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:46,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:46,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:46,238 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-10-22 08:54:46,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:46,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:46,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:46,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:46,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:46,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:46,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:46,244 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:46,247 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:46,247 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:46,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:46,248 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:46,248 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:46,248 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:46,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,279 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-10-22 08:54:46,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:54:46,289 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-10-22 08:54:46,289 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-10-22 08:54:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:46,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:46,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 08:54:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-10-22 08:54:46,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:46,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-10-22 08:54:46,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:54:46,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:46,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-10-22 08:54:46,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:46,293 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-10-22 08:54:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:54:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-10-22 08:54:46,294 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:46,294 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-10-22 08:54:46,294 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:46,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-10-22 08:54:46,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:46,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:46,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:46,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:46,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:46,296 INFO L791 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-10-22 08:54:46,296 INFO L793 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-10-22 08:54:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-10-22 08:54:46,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446951349] [2019-10-22 08:54:46,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,308 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-10-22 08:54:46,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300530441] [2019-10-22 08:54:46,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-10-22 08:54:46,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460780289] [2019-10-22 08:54:46,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,341 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,342 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:46,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-10-22 08:54:46,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,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-10-22 08:54:46,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,400 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:46,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,409 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,413 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:46,413 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:46,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,427 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:46,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:46,448 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:46,452 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,453 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:46,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-10-22 08:54:46,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,453 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,514 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:46,514 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-10-22 08:54:46,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:46,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:46,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:46,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:46,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:46,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:46,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:46,520 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:46,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:46,523 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:46,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:46,523 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:46,523 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:46,524 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:46,524 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,558 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-10-22 08:54:46,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:46,568 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-10-22 08:54:46,568 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-10-22 08:54:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:46,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:46,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,569 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,601 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-10-22 08:54:46,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:46,611 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-10-22 08:54:46,611 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-10-22 08:54:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:54:46,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:46,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,612 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,644 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-10-22 08:54:46,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:46,654 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-10-22 08:54:46,655 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-10-22 08:54:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:46,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-10-22 08:54:46,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:46,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-10-22 08:54:46,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 08:54:46,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-10-22 08:54:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:46,659 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-10-22 08:54:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-10-22 08:54:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-10-22 08:54:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-10-22 08:54:46,660 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-10-22 08:54:46,660 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-10-22 08:54:46,660 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:46,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-10-22 08:54:46,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:46,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:46,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:46,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:46,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:46,661 INFO L791 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-10-22 08:54:46,662 INFO L793 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-10-22 08:54:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-10-22 08:54:46,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69466142] [2019-10-22 08:54:46,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,667 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-10-22 08:54:46,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135807073] [2019-10-22 08:54:46,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-10-22 08:54:46,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906161654] [2019-10-22 08:54:46,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,681 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,698 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,699 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:46,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-10-22 08:54:46,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,699 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,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-10-22 08:54:46,755 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,755 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:46,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:46,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:46,769 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:46,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,775 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:46,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:46,784 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:46,794 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:46,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:46,800 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:46,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:46,810 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-10-22 08:54:46,824 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:46,826 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:46,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-10-22 08:54:46,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,827 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,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-10-22 08:54:46,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-10-22 08:54:46,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:46,882 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:46,882 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-10-22 08:54:46,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:46,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:46,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:46,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:46,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:46,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:46,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:46,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:46,887 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-10-22 08:54:46,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:46,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:46,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:46,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:46,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:46,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:46,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:46,902 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:46,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:46,904 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:46,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:46,905 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:46,905 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:46,905 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-10-22 08:54:46,905 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,938 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,939 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-10-22 08:54:46,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:54:46,952 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-10-22 08:54:46,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-10-22 08:54:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-10-22 08:54:46,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-10-22 08:54:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-10-22 08:54:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:46,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-10-22 08:54:46,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:46,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-10-22 08:54:46,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:54:46,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-10-22 08:54:46,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-10-22 08:54:46,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:46,957 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-10-22 08:54:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-10-22 08:54:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-10-22 08:54:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-10-22 08:54:46,958 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-10-22 08:54:46,958 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-10-22 08:54:46,958 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:46,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-10-22 08:54:46,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:46,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:46,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:46,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-10-22 08:54:46,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:46,964 INFO L791 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-10-22 08:54:46,964 INFO L793 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-10-22 08:54:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-10-22 08:54:46,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243529867] [2019-10-22 08:54:46,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243529867] [2019-10-22 08:54:47,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:47,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461848945] [2019-10-22 08:54:47,013 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-10-22 08:54:47,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972838472] [2019-10-22 08:54:47,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,023 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:47,042 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:47,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:47,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:47,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:47,042 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:47,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:47,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:47,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-10-22 08:54:47,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:47,043 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:47,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,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-10-22 08:54:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,105 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:47,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:47,110 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:47,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:47,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:47,133 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:47,133 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:47,139 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:47,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:47,156 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:47,158 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:47,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:47,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:47,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:47,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:47,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:47,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:47,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-10-22 08:54:47,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:47,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:47,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,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-10-22 08:54:47,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-10-22 08:54:47,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,219 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:47,220 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-10-22 08:54:47,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:47,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:47,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:47,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:47,225 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-10-22 08:54:47,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,227 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:47,227 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:47,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:47,234 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-10-22 08:54:47,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:47,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:47,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:47,246 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:47,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:47,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:47,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:47,249 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:47,249 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:47,249 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-10-22 08:54:47,250 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,329 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-10-22 08:54:47,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:47,340 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-10-22 08:54:47,341 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-10-22 08:54:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 08:54:47,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:47,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,341 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,372 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-10-22 08:54:47,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:47,387 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-10-22 08:54:47,387 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-10-22 08:54:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,388 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,418 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-10-22 08:54:47,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:47,425 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-10-22 08:54:47,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-10-22 08:54:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-10-22 08:54:47,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:47,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:54:47,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:54:47,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-10-22 08:54:47,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:54:47,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-10-22 08:54:47,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:47,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:47,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 08:54:47,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:47,429 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:54:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 08:54:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-10-22 08:54:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-10-22 08:54:47,430 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-10-22 08:54:47,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:47,434 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-10-22 08:54:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,448 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-10-22 08:54:47,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:47,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-10-22 08:54:47,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:47,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-10-22 08:54:47,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:47,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:47,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-10-22 08:54:47,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:47,450 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:54:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-10-22 08:54:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-10-22 08:54:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:54:47,451 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:47,451 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:47,451 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:47,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-10-22 08:54:47,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:47,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:47,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:47,452 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-10-22 08:54:47,452 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-10-22 08:54:47,452 INFO L791 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-10-22 08:54:47,452 INFO L793 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-10-22 08:54:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-10-22 08:54:47,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247734547] [2019-10-22 08:54:47,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-10-22 08:54:47,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586871753] [2019-10-22 08:54:47,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,467 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-10-22 08:54:47,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928339275] [2019-10-22 08:54:47,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,477 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:47,510 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:47,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:47,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:47,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:47,511 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:47,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:47,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:47,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-10-22 08:54:47,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:47,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:47,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,565 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,566 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:47,573 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:47,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:47,592 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:47,594 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:47,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:47,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:47,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:47,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:47,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:47,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:47,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-10-22 08:54:47,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:47,595 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:47,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,651 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,651 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:47,652 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-10-22 08:54:47,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:47,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:47,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:47,656 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:47,658 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:47,658 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:47,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:47,658 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:47,659 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:47,659 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-10-22 08:54:47,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,710 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-10-22 08:54:47,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:47,718 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-10-22 08:54:47,719 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-10-22 08:54:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 08:54:47,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,719 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,777 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-10-22 08:54:47,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:47,794 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-10-22 08:54:47,794 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-10-22 08:54:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:47,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:47,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,795 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,842 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-10-22 08:54:47,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:47,849 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-10-22 08:54:47,850 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-10-22 08:54:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-10-22 08:54:47,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:47,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,851 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,898 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-10-22 08:54:47,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:47,916 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-10-22 08:54:47,918 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-10-22 08:54:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:47,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:47,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,918 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,957 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-10-22 08:54:47,958 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-10-22 08:54:48,005 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-10-22 08:54:48,006 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-10-22 08:54:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:54:48,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:48,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:54:48,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 08:54:48,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-10-22 08:54:48,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 08:54:48,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-10-22 08:54:48,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-10-22 08:54:48,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-10-22 08:54:48,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-10-22 08:54:48,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:48,011 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-22 08:54:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-10-22 08:54:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-10-22 08:54:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:54:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-10-22 08:54:48,014 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-10-22 08:54:48,014 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-10-22 08:54:48,014 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:48,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-10-22 08:54:48,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:48,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:48,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:48,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-10-22 08:54:48,015 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-10-22 08:54:48,015 INFO L791 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-10-22 08:54:48,015 INFO L793 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-10-22 08:54:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-10-22 08:54:48,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398890646] [2019-10-22 08:54:48,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:48,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398890646] [2019-10-22 08:54:48,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13112740] [2019-10-22 08:54:48,034 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-22 08:54:48,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:48,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:48,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:48,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-10-22 08:54:48,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156977164] [2019-10-22 08:54:48,086 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-10-22 08:54:48,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667029799] [2019-10-22 08:54:48,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,095 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:48,142 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:48,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:48,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:48,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:48,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:48,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:48,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:48,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-10-22 08:54:48,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:48,143 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:48,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:48,193 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:48,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:48,204 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 [2019-10-22 08:54:48,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:48,208 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:48,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:48,214 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:48,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:48,223 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,276 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:48,277 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:48,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:48,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:48,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:48,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:48,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:48,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:48,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-10-22 08:54:48,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:48,278 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:48,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-10-22 08:54:48,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,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-10-22 08:54:48,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:48,323 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:48,323 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-10-22 08:54:48,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:48,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:48,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:48,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:48,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:48,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:48,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:48,329 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-10-22 08:54:48,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:48,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:48,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:48,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:48,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:48,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:48,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:48,333 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:48,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:48,335 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:48,335 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:48,335 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:48,336 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:48,336 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:48,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,384 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-10-22 08:54:48,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 08:54:48,409 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-10-22 08:54:48,409 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-10-22 08:54:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:54:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:54:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 08:54:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-10-22 08:54:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2019-10-22 08:54:48,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:48,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2019-10-22 08:54:48,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:54:48,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-10-22 08:54:48,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-10-22 08:54:48,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:48,413 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-10-22 08:54:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-10-22 08:54:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-10-22 08:54:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:54:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2019-10-22 08:54:48,423 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-10-22 08:54:48,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:48,423 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2019-10-22 08:54:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,436 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-10-22 08:54:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:48,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-10-22 08:54:48,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:48,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2019-10-22 08:54:48,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-10-22 08:54:48,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-10-22 08:54:48,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-10-22 08:54:48,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:48,437 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:54:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-10-22 08:54:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-10-22 08:54:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-10-22 08:54:48,439 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:48,439 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:48,439 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:48,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-10-22 08:54:48,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:48,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:48,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:48,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-10-22 08:54:48,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-10-22 08:54:48,439 INFO L791 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-10-22 08:54:48,440 INFO L793 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-10-22 08:54:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-10-22 08:54:48,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767154474] [2019-10-22 08:54:48,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,449 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-10-22 08:54:48,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667023410] [2019-10-22 08:54:48,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,455 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-10-22 08:54:48,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650295213] [2019-10-22 08:54:48,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650295213] [2019-10-22 08:54:48,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865432043] [2019-10-22 08:54:48,514 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:48,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:48,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-10-22 08:54:48,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910836366] [2019-10-22 08:54:48,616 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:48,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:48,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:48,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:48,616 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:48,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:48,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:48,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-10-22 08:54:48,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:48,616 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:48,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:48,668 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:48,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:48,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:48,675 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:48,675 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:48,679 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:48,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:48,732 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:48,733 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:48,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:48,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:48,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:48,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:48,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:48,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:48,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-10-22 08:54:48,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:48,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:48,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:48,787 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:48,788 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:48,788 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-10-22 08:54:48,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:48,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:48,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:48,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:48,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:48,790 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:48,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:48,792 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-10-22 08:54:48,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:48,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:48,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:48,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:48,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:48,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:48,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:48,795 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:48,797 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:48,797 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:48,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:48,797 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:48,797 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:48,797 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:48,798 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,844 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-10-22 08:54:48,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:48,858 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-10-22 08:54:48,859 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-10-22 08:54:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 08:54:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,859 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,901 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-10-22 08:54:48,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:48,916 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-10-22 08:54:48,916 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-10-22 08:54:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 08:54:48,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:48,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,917 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,960 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-10-22 08:54:48,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:48,985 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-10-22 08:54:48,988 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-10-22 08:54:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-10-22 08:54:48,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:54:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-10-22 08:54:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-10-22 08:54:48,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:48,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-10-22 08:54:48,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-10-22 08:54:48,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-10-22 08:54:48,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:48,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 08:54:48,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-10-22 08:54:48,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:48,993 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-10-22 08:54:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-10-22 08:54:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-10-22 08:54:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:54:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-10-22 08:54:48,996 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-10-22 08:54:48,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:54:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:54:48,997 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-10-22 08:54:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,128 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-10-22 08:54:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:54:49,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-10-22 08:54:49,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-10-22 08:54:49,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-10-22 08:54:49,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 08:54:49,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:54:49,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-10-22 08:54:49,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:49,132 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-10-22 08:54:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-10-22 08:54:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-10-22 08:54:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:54:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 08:54:49,137 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:54:49,137 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:54:49,137 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:54:49,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-10-22 08:54:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 08:54:49,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,138 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:49,138 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-10-22 08:54:49,139 INFO L791 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-10-22 08:54:49,139 INFO L793 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-10-22 08:54:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-10-22 08:54:49,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657316956] [2019-10-22 08:54:49,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-10-22 08:54:49,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071414938] [2019-10-22 08:54:49,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:49,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071414938] [2019-10-22 08:54:49,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506785256] [2019-10-22 08:54:49,173 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:49,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:49,174 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,181 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-10-22 08:54:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:49,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-10-22 08:54:49,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:54:49,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-10-22 08:54:49,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:54:49,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:49,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-10-22 08:54:49,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:49,184 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-22 08:54:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-10-22 08:54:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-22 08:54:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:54:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-22 08:54:49,187 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:54:49,187 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:54:49,187 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:54:49,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-10-22 08:54:49,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:54:49,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:49,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-10-22 08:54:49,188 INFO L791 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-10-22 08:54:49,189 INFO L793 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-10-22 08:54:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-10-22 08:54:49,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738709717] [2019-10-22 08:54:49,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-10-22 08:54:49,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784859149] [2019-10-22 08:54:49,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-10-22 08:54:49,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883094758] [2019-10-22 08:54:49,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,215 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,292 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:49,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:49,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:49,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:49,293 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:49,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:49,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:49,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:49,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-10-22 08:54:49,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:49,293 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:49,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,352 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:49,352 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:49,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:49,360 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:49,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:49,364 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:49,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:49,368 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:49,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:49,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:49,380 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:49,387 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:49,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:49,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:49,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:49,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:49,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:49,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:49,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:49,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-10-22 08:54:49,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:49,388 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:49,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:49,439 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:49,439 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:49,440 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-10-22 08:54:49,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:49,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:49,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:49,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:49,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:49,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:49,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:49,443 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-10-22 08:54:49,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:49,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:49,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:49,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:49,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:49,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:49,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:49,445 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:49,447 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:49,447 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:49,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:49,447 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:49,448 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:49,448 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:49,448 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,542 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-10-22 08:54:49,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:49,547 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-10-22 08:54:49,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-10-22 08:54:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:49,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:49,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,550 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,622 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-10-22 08:54:49,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:49,626 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-10-22 08:54:49,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-10-22 08:54:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:49,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:49,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,627 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,691 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-10-22 08:54:49,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:49,703 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-10-22 08:54:49,704 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-10-22 08:54:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:49,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:49,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,705 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,756 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-10-22 08:54:49,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:49,789 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-10-22 08:54:49,789 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-10-22 08:54:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:49,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:49,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,790 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,840 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-10-22 08:54:49,840 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:49,882 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,882 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,883 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,883 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:49,927 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-10-22 08:54:49,934 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-10-22 08:54:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-10-22 08:54:49,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:54:49,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-10-22 08:54:49,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-10-22 08:54:49,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:49,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-10-22 08:54:49,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-10-22 08:54:49,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-10-22 08:54:49,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 08:54:49,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:49,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-10-22 08:54:49,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:49,944 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-10-22 08:54:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-10-22 08:54:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-10-22 08:54:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 08:54:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-10-22 08:54:49,949 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-10-22 08:54:49,949 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-10-22 08:54:49,949 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:54:49,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-10-22 08:54:49,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-10-22 08:54:49,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:49,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-10-22 08:54:49,951 INFO L791 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-10-22 08:54:49,951 INFO L793 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-10-22 08:54:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-10-22 08:54:49,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506396168] [2019-10-22 08:54:49,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-10-22 08:54:49,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804723162] [2019-10-22 08:54:49,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-10-22 08:54:49,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521618150] [2019-10-22 08:54:49,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,070 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:50,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:50,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:50,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:50,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:50,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:50,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:50,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-10-22 08:54:50,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:50,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,118 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:50,118 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:50,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:50,121 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:50,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:50,135 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:50,136 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:50,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:50,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:50,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:50,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:50,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:50,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:50,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-10-22 08:54:50,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:50,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:50,186 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:50,187 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-10-22 08:54:50,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:50,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:50,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,190 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-10-22 08:54:50,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,191 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:50,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:50,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,193 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-10-22 08:54:50,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,196 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:50,197 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:50,197 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:50,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:50,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:50,198 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:50,198 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:50,198 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,278 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-10-22 08:54:50,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:50,282 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-10-22 08:54:50,285 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-10-22 08:54:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:50,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:50,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,367 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-10-22 08:54:50,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:50,374 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-10-22 08:54:50,374 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-10-22 08:54:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:50,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:50,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,375 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,451 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-10-22 08:54:50,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:50,457 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-10-22 08:54:50,457 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-10-22 08:54:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:50,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:50,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,458 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,537 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-10-22 08:54:50,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:50,562 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-10-22 08:54:50,563 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-10-22 08:54:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:50,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:50,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,635 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-10-22 08:54:50,635 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-10-22 08:54:50,684 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,685 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,689 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,689 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,689 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,729 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,731 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,732 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,732 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,732 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,732 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,732 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,733 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,735 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,776 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,777 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,779 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,779 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,779 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,780 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,781 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,782 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,783 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:50,807 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-10-22 08:54:50,808 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-10-22 08:54:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-10-22 08:54:50,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:54:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-10-22 08:54:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-10-22 08:54:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:50,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-10-22 08:54:50,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-10-22 08:54:50,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-10-22 08:54:50,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:54:50,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:54:50,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-10-22 08:54:50,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:50,829 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-10-22 08:54:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-10-22 08:54:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-10-22 08:54:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 08:54:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-10-22 08:54:50,842 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-10-22 08:54:50,842 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-10-22 08:54:50,842 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:54:50,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-10-22 08:54:50,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 08:54:50,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:50,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:50,844 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:50,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-10-22 08:54:50,844 INFO L791 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-10-22 08:54:50,844 INFO L793 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-10-22 08:54:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-10-22 08:54:50,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924995112] [2019-10-22 08:54:50,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,849 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-10-22 08:54:50,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775862818] [2019-10-22 08:54:50,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,858 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-10-22 08:54:50,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890229978] [2019-10-22 08:54:50,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,869 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,973 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:50,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:50,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:50,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:50,973 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:50,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:50,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:50,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-10-22 08:54:50,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:50,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,008 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:51,008 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:51,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:51,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:51,013 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:51,017 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:51,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:51,027 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:51,028 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:51,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:51,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:51,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:51,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:51,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:51,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:51,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-10-22 08:54:51,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:51,028 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:51,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-10-22 08:54:51,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,066 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:51,066 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:51,066 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-10-22 08:54:51,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,069 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-10-22 08:54:51,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,070 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,072 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-10-22 08:54:51,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:51,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,074 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:51,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:51,076 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:51,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:51,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:51,076 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:51,076 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:51,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,174 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-10-22 08:54:51,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-10-22 08:54:51,185 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-10-22 08:54:51,186 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-10-22 08:54:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:51,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:51,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,187 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,298 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-10-22 08:54:51,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-10-22 08:54:51,310 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-10-22 08:54:51,311 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-10-22 08:54:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:51,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:51,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,312 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,420 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-10-22 08:54:51,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-10-22 08:54:51,426 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-10-22 08:54:51,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-10-22 08:54:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:51,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:51,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,427 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,540 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-10-22 08:54:51,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-10-22 08:54:51,573 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-10-22 08:54:51,573 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-10-22 08:54:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:51,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:51,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,574 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:51,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,710 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-10-22 08:54:51,710 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-10-22 08:54:51,761 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,762 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,762 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,763 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,764 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,765 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,766 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,768 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,769 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,769 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,770 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,770 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,770 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,770 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,771 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,771 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,811 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,812 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,813 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,814 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,814 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,814 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,816 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,816 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,816 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,818 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,820 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,872 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,872 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,872 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,872 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,872 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,873 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,875 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,876 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,879 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,879 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,879 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,879 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,881 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,881 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,881 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,881 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,881 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,882 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,884 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,885 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,886 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,888 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,889 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,889 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,889 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,889 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,889 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,890 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,891 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,961 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,961 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,963 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,963 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,963 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,963 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,963 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,964 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,964 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,964 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,964 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:51,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:52,004 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-10-22 08:54:52,005 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-10-22 08:54:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:54:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2019-10-22 08:54:52,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2019-10-22 08:54:52,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2019-10-22 08:54:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2019-10-22 08:54:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2019-10-22 08:54:52,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-10-22 08:54:52,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2019-10-22 08:54:52,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:54:52,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:54:52,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2019-10-22 08:54:52,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:52,056 INFO L688 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2019-10-22 08:54:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2019-10-22 08:54:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2019-10-22 08:54:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-22 08:54:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2019-10-22 08:54:52,088 INFO L711 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-10-22 08:54:52,088 INFO L591 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-10-22 08:54:52,088 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:54:52,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2019-10-22 08:54:52,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-10-22 08:54:52,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:52,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:52,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:52,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2019-10-22 08:54:52,093 INFO L791 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-10-22 08:54:52,093 INFO L793 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-10-22 08:54:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2019-10-22 08:54:52,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931448694] [2019-10-22 08:54:52,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2019-10-22 08:54:52,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316482241] [2019-10-22 08:54:52,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,117 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2019-10-22 08:54:52,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875529655] [2019-10-22 08:54:52,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:52,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:52,337 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-10-22 08:54:52,348 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:52,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:52,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:52,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:52,348 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:52,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:52,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:52,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-10-22 08:54:52,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:52,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:52,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:52,391 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:52,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:52,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:52,396 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/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-10-22 08:54:52,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:52,403 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:52,403 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 /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,408 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:52,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:52,417 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:52,418 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:52,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:52,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:52,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:52,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:52,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:52,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:52,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-10-22 08:54:52,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:52,419 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:52,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,459 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:52,459 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:52,460 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-10-22 08:54:52,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,463 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-10-22 08:54:52,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,466 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-10-22 08:54:52,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,469 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:52,470 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:52,470 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:52,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:52,470 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:52,471 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:52,471 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:52,471 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:52,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,588 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-10-22 08:54:52,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-10-22 08:54:52,596 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-10-22 08:54:52,597 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-10-22 08:54:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:52,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-10-22 08:54:52,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,597 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,731 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-10-22 08:54:52,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-10-22 08:54:52,735 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-10-22 08:54:52,736 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-10-22 08:54:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:52,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-10-22 08:54:52,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,736 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,881 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-10-22 08:54:52,881 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-10-22 08:54:52,889 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-10-22 08:54:52,890 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-10-22 08:54:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-10-22 08:54:52,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2019-10-22 08:54:52,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,891 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:53,014 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-10-22 08:54:53,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-10-22 08:54:53,036 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-10-22 08:54:53,036 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-10-22 08:54:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:53,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2019-10-22 08:54:53,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:53,037 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:53,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:53,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:53,146 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-10-22 08:54:53,146 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-10-22 08:54:53,213 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,215 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,215 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,215 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,224 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,224 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,224 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,273 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,273 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,273 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,273 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,274 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,274 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,277 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,277 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,277 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,277 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,278 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,278 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,278 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,281 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,353 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,356 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,356 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,360 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,361 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,361 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,361 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,361 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,362 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,363 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,363 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,363 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,364 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,369 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,370 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,371 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,373 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,373 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,373 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,373 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,373 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,376 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,377 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,400 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,400 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,400 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,400 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,404 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,404 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,405 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,405 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,405 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,405 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,406 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,406 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,406 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,406 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,407 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,407 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,407 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,407 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,408 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,411 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,411 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,412 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,412 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,412 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,412 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,413 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,413 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,531 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,605 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,606 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,607 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,627 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,628 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,629 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,630 WARN L278 uchiComplementFKVNwa]: big8 [2019-10-22 08:54:53,665 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-10-22 08:54:53,665 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-10-22 08:54:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2019-10-22 08:54:53,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2019-10-22 08:54:53,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:53,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2019-10-22 08:54:53,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:53,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2019-10-22 08:54:53,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:53,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2019-10-22 08:54:53,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-10-22 08:54:53,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2019-10-22 08:54:53,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:54:53,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:53,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2019-10-22 08:54:53,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:53,778 INFO L688 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2019-10-22 08:54:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2019-10-22 08:54:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2019-10-22 08:54:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-10-22 08:54:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2019-10-22 08:54:53,816 INFO L711 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-10-22 08:54:53,816 INFO L591 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-10-22 08:54:53,816 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:54:53,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2019-10-22 08:54:53,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-10-22 08:54:53,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:53,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:53,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-10-22 08:54:53,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2019-10-22 08:54:53,822 INFO L791 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-10-22 08:54:53,822 INFO L793 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-10-22 08:54:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2019-10-22 08:54:53,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865025832] [2019-10-22 08:54:53,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2019-10-22 08:54:53,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772446451] [2019-10-22 08:54:53,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2019-10-22 08:54:53,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844012603] [2019-10-22 08:54:53,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:53,850 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,045 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-10-22 08:54:54,056 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:54,057 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:54,057 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:54,057 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:54,057 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:54,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:54,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:54,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:54,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-10-22 08:54:54,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:54,057 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:54,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,092 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:54,093 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:54,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:54,096 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c83b52a-61e9-4385-99b8-8da085a57fd3/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:54,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:54,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:54,134 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:54,135 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:54,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:54,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:54,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:54,135 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:54,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:54,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:54,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:54,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-10-22 08:54:54,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:54,136 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:54,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:54,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:54,176 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:54,176 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-10-22 08:54:54,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,178 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,178 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,179 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-10-22 08:54:54,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,181 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:54,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:54,183 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:54,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:54,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:54,183 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:54,183 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-10-22 08:54:54,183 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 08:54:54,263 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-10-22 08:54:54,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-10-22 08:54:54,278 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-10-22 08:54:54,278 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-10-22 08:54:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-10-22 08:54:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,279 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 08:54:54,335 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-10-22 08:54:54,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-10-22 08:54:54,346 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-10-22 08:54:54,346 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-10-22 08:54:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-10-22 08:54:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-10-22 08:54:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,347 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 08:54:54,405 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-10-22 08:54:54,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-10-22 08:54:54,432 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-10-22 08:54:54,432 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-10-22 08:54:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-10-22 08:54:54,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2019-10-22 08:54:54,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,433 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 08:54:54,504 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-10-22 08:54:54,504 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-10-22 08:54:54,548 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-10-22 08:54:54,548 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-10-22 08:54:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-10-22 08:54:54,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2019-10-22 08:54:54,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2019-10-22 08:54:54,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2019-10-22 08:54:54,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2019-10-22 08:54:54,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:54,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:54,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:54,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:54,563 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 08:54:54,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:54,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:54,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:54,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:54 BoogieIcfgContainer [2019-10-22 08:54:54,570 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:54,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:54,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:54,571 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:54,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:45" (3/4) ... [2019-10-22 08:54:54,574 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:54,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:54,578 INFO L168 Benchmark]: Toolchain (without parser) took 9918.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.8 MB). Free memory was 949.8 MB in the beginning and 939.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,579 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.8 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.89 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-10-22 08:54:54,582 INFO L168 Benchmark]: Boogie Preprocessor took 16.68 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-10-22 08:54:54,582 INFO L168 Benchmark]: RCFGBuilder took 158.30 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,582 INFO L168 Benchmark]: BuchiAutomizer took 9439.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 939.2 MB in the end (delta: 172.7 MB). Peak memory consumption was 397.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,582 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,584 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.8 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.89 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. * Boogie Preprocessor took 16.68 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 158.30 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9439.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 939.2 MB in the end (delta: 172.7 MB). Peak memory consumption was 397.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 939.2 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 9.3s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 4.0s. Construction of modules took 0.4s. Büchi inclusion checks took 4.4s. 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.2s 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.4s 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: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...