./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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:42,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:45:42,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:45:42,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:45:42,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:45:42,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:45:42,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:45:42,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:45:42,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:45:42,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:45:42,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:45:42,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:45:42,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:45:42,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:45:42,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:45:42,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:45:42,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:45:42,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:45:42,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:45:42,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:45:42,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:45:42,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:45:42,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:45:42,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:45:42,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:45:42,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:45:42,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:45:42,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:45:42,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:45:42,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:45:42,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:45:42,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:45:42,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:45:42,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:45:42,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:45:42,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:45:42,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:45:42,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:45:42,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:45:42,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:45:42,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:45:42,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:45:43,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:45:43,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:45:43,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:45:43,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:45:43,012 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:45:43,012 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:45:43,012 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:45:43,013 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:45:43,013 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:45:43,013 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:45:43,014 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:45:43,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:45:43,015 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:45:43,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:45:43,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:45:43,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:45:43,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:45:43,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:45:43,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:45:43,017 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:45:43,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:45:43,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:45:43,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:45:43,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:45:43,019 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:45:43,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:45:43,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:45:43,020 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:45:43,023 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:45:43,023 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:43,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:45:43,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:45:43,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:45:43,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:45:43,086 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:45:43,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-11-15 22:45:43,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/data/780162220/f0c8fc5ea4284653880c8937bc136ed7/FLAG428c332cb [2019-11-15 22:45:43,616 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:45:43,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2019-11-15 22:45:43,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/data/780162220/f0c8fc5ea4284653880c8937bc136ed7/FLAG428c332cb [2019-11-15 22:45:43,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/bin/uautomizer/data/780162220/f0c8fc5ea4284653880c8937bc136ed7 [2019-11-15 22:45:43,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:45:43,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:45:43,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:43,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:45:43,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:45:43,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:43" (1/1) ... [2019-11-15 22:45:43,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7c4fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:43, skipping insertion in model container [2019-11-15 22:45:43,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:43" (1/1) ... [2019-11-15 22:45:43,982 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:45:44,000 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:45:44,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:44,211 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:45:44,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:44,350 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:45:44,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44 WrapperNode [2019-11-15 22:45:44,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:44,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:44,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:45:44,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:45:44,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:44,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:45:44,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:45:44,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:45:44,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... [2019-11-15 22:45:44,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:45:44,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:45:44,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:45:44,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:45:44,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:44,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:45:44,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:45:44,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:45:44,631 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:45:44,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:44 BoogieIcfgContainer [2019-11-15 22:45:44,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:45:44,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:45:44,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:45:44,637 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:45:44,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:44,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:45:43" (1/3) ... [2019-11-15 22:45:44,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ca8d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:44, skipping insertion in model container [2019-11-15 22:45:44,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:44,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:44" (2/3) ... [2019-11-15 22:45:44,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ca8d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:44, skipping insertion in model container [2019-11-15 22:45:44,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:44,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:44" (3/3) ... [2019-11-15 22:45:44,644 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2019-11-15 22:45:44,697 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:45:44,698 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:45:44,698 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:45:44,698 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:45:44,698 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:45:44,698 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:45:44,699 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:45:44,699 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:45:44,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-15 22:45:44,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:44,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:44,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:44,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 22:45:44,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:44,745 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:45:44,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-15 22:45:44,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:44,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:44,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:44,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 22:45:44,748 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:44,756 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-11-15 22:45:44,757 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-11-15 22:45:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 22:45:44,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:44,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549836136] [2019-11-15 22:45:44,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,864 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-15 22:45:44,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:44,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210569327] [2019-11-15 22:45:44,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,883 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-15 22:45:44,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:44,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079043149] [2019-11-15 22:45:44,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:44,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:44,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:44,996 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:44,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:44,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:44,998 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:44,998 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:44,998 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:44,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:44,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:44,999 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-11-15 22:45:44,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:44,999 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:45,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,227 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:45,228 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:45,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:45,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:45,257 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:45,257 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:45,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:45,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:45,269 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:45,269 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:45,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:45,277 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:45,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:45,309 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:45,320 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:45,322 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:45,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:45,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:45,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:45,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:45,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:45,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:45,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:45,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2019-11-15 22:45:45,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:45,324 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,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-11-15 22:45:45,445 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:45,451 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:45,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:45,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:45,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:45,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:45,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:45,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:45,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:45,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:45,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:45,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:45,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:45,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:45,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:45,499 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:45,499 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:45,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:45,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:45,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:45,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:45,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:45,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:45,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:45,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:45,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:45,539 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:45,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:45,557 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:45,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:45,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:45,559 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:45,560 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:45,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:45,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:45,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:45,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:45,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:45,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 22:45:45,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-15 22:45:45,701 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-11-15 22:45:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-15 22:45:45,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-15 22:45:45,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 22:45:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 22:45:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:45,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-15 22:45:45,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:45,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-15 22:45:45,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 22:45:45,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-15 22:45:45,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-15 22:45:45,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:45,728 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 22:45:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-15 22:45:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 22:45:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-15 22:45:45,763 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 22:45:45,764 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 22:45:45,764 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:45:45,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-15 22:45:45,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:45,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:45,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:45,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:45:45,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:45,768 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-11-15 22:45:45,769 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-11-15 22:45:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-15 22:45:45,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:45,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790380210] [2019-11-15 22:45:45,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,791 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-15 22:45:45,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:45,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011078983] [2019-11-15 22:45:45,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,816 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-15 22:45:45,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:45,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406755789] [2019-11-15 22:45:45,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:45,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:45,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:45,865 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:45,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:45,865 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:45,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:45,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:45,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:45,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:45,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:45,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-11-15 22:45:45,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:45,867 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:45,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:45,982 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:45,982 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:45,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:45,996 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,008 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:46,008 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:46,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:46,021 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:46,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:46,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:46,053 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:46,056 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:46,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:46,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:46,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:46,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:46,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:46,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:46,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2019-11-15 22:45:46,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:46,057 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:46,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-11-15 22:45:46,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,179 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:46,180 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:46,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:46,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:46,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:46,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:46,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:46,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:46,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:46,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:46,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:46,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:46,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:46,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:46,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:46,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:46,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:46,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:46,204 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:46,208 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:46,208 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:46,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:46,209 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:46,209 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:46,209 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-15 22:45:46,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:46,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:46,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:45:46,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-11-15 22:45:46,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-11-15 22:45:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 22:45:46,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 22:45:46,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:46,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:45:46,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:46,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 22:45:46,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:46,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-15 22:45:46,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:46,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-15 22:45:46,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:45:46,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 22:45:46,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-15 22:45:46,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:46,316 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 22:45:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-15 22:45:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 22:45:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-15 22:45:46,319 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 22:45:46,319 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 22:45:46,321 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:45:46,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-15 22:45:46,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:46,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:46,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:46,325 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:46,325 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:46,325 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-11-15 22:45:46,325 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-11-15 22:45:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-15 22:45:46,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:46,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890981556] [2019-11-15 22:45:46,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,355 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-15 22:45:46,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:46,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241106816] [2019-11-15 22:45:46,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,388 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-15 22:45:46,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:46,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476285387] [2019-11-15 22:45:46,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:46,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:46,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:46,449 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:46,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:46,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:46,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:46,449 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:46,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:46,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:46,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-11-15 22:45:46,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:46,450 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:46,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,557 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:46,557 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:46,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:46,573 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:46,579 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:46,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:46,598 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:46,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:46,622 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,636 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:46,639 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:46,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:46,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:46,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:46,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:46,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:46,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:46,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:46,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2019-11-15 22:45:46,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:46,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:46,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:46,770 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:46,771 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:46,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:46,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:46,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:46,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:46,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:46,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:46,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:46,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:46,778 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:46,790 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:46,790 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:46,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:46,791 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:46,791 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:46,791 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-15 22:45:46,792 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:46,851 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:46,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:45:46,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-15 22:45:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 22:45:46,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:45:46,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:46,880 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:46,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:46,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:46,957 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:46,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:45:46,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-15 22:45:46,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 22:45:46,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:45:46,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:46,982 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:47,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:47,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:47,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:47,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:47,036 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:47,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:45:47,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-11-15 22:45:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:47,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:45:47,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:45:47,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:45:47,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-15 22:45:47,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:47,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-15 22:45:47,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-15 22:45:47,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 22:45:47,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-15 22:45:47,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:47,061 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-15 22:45:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-15 22:45:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-15 22:45:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-15 22:45:47,063 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-15 22:45:47,063 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-15 22:45:47,063 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:45:47,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-15 22:45:47,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:47,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:47,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:47,068 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 22:45:47,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:47,068 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-11-15 22:45:47,069 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-11-15 22:45:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 22:45:47,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:47,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567040485] [2019-11-15 22:45:47,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-15 22:45:47,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:47,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624159491] [2019-11-15 22:45:47,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-15 22:45:47,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:47,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871405583] [2019-11-15 22:45:47,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,121 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:47,147 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:47,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:47,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:47,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:47,148 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:47,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:47,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:47,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-11-15 22:45:47,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:47,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:47,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-11-15 22:45:47,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,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-11-15 22:45:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,266 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:47,267 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:47,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:47,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:47,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:47,280 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:47,285 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:47,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:47,305 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:47,305 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:47,311 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:47,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:47,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:47,343 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:47,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:47,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:47,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:47,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:47,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:47,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:47,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2019-11-15 22:45:47,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:47,345 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:47,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,485 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:47,485 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:47,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:47,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:47,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:47,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:47,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:47,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:47,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:47,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:47,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:47,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:47,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:47,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:47,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:47,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:47,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:47,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:47,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:47,500 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:47,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:47,503 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:45:47,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:47,504 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:47,504 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:47,504 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-11-15 22:45:47,505 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:47,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:47,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:47,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:47,554 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 22:45:47,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-15 22:45:47,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-11-15 22:45:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-15 22:45:47,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-15 22:45:47,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 22:45:47,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 22:45:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:47,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-15 22:45:47,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:47,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-15 22:45:47,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 22:45:47,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-15 22:45:47,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-15 22:45:47,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:47,575 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-15 22:45:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-15 22:45:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 22:45:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:45:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-15 22:45:47,577 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-15 22:45:47,577 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-15 22:45:47,577 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:45:47,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-15 22:45:47,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:47,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:47,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:47,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-15 22:45:47,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:47,584 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-11-15 22:45:47,585 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-11-15 22:45:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-15 22:45:47,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:47,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060122133] [2019-11-15 22:45:47,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:47,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060122133] [2019-11-15 22:45:47,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:47,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:45:47,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090105577] [2019-11-15 22:45:47,649 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:45:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-15 22:45:47,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:47,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535476921] [2019-11-15 22:45:47,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:47,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:47,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:47,689 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:47,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:47,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:47,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:47,689 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:47,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:47,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:47,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-11-15 22:45:47,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:47,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:47,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:47,781 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:47,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:47,786 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:47,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:47,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:47,812 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:47,812 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:47,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:47,819 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:47,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:47,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:47,858 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:47,860 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:47,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:47,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:47,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:47,861 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:47,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:47,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:47,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:47,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2019-11-15 22:45:47,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:47,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:47,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:47,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:47,978 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:47,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:47,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:47,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:47,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:47,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:47,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:47,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:47,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:47,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:47,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:47,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:47,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:47,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:47,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:47,994 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:47,995 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:47,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:48,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:48,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:48,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:48,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:48,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:48,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:48,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:48,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:48,013 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:48,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:48,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:45:48,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:48,026 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:48,027 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:48,027 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-11-15 22:45:48,028 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:48,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:45:48,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-11-15 22:45:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 22:45:48,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:45:48,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,099 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,134 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:48,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:45:48,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-15 22:45:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:48,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:45:48,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,171 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,219 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:45:48,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:45:48,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-11-15 22:45:48,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-15 22:45:48,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:45:48,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:45:48,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 22:45:48,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-15 22:45:48,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:48,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-15 22:45:48,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-15 22:45:48,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-15 22:45:48,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 22:45:48,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:48,241 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:45:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 22:45:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-15 22:45:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-15 22:45:48,243 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 22:45:48,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:48,248 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-15 22:45:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:48,268 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-15 22:45:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:48,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-15 22:45:48,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:45:48,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-15 22:45:48,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-15 22:45:48,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-15 22:45:48,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-15 22:45:48,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:48,272 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:45:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-15 22:45:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-15 22:45:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-15 22:45:48,273 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 22:45:48,273 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 22:45:48,274 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:45:48,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-15 22:45:48,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:45:48,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:48,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:48,275 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-15 22:45:48,275 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-15 22:45:48,275 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-11-15 22:45:48,275 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-11-15 22:45:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-15 22:45:48,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:48,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982800259] [2019-11-15 22:45:48,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,296 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-15 22:45:48,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:48,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905865240] [2019-11-15 22:45:48,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,312 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-15 22:45:48,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:48,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748874740] [2019-11-15 22:45:48,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:48,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:48,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:48,425 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:48,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:48,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:48,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:48,425 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:48,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:48,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:48,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:48,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-11-15 22:45:48,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:48,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:48,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-11-15 22:45:48,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:48,510 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:48,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:48,514 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:48,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:48,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:48,532 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:48,535 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:48,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:48,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:48,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:48,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:48,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:48,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:48,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:48,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2019-11-15 22:45:48,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:48,536 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:48,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:48,632 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:48,633 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:48,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:48,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:48,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:48,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:48,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:48,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:48,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:48,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:48,639 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:48,642 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:48,642 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:45:48,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:48,643 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:48,643 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:48,643 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2019-11-15 22:45:48,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:48,741 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:45:48,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-11-15 22:45:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 22:45:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,751 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:48,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:45:48,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-11-15 22:45:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:48,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:48,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,838 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,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-11-15 22:45:48,898 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:48,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:45:48,907 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-11-15 22:45:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-15 22:45:48,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:48,909 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:48,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:48,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:48,985 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:48,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:45:49,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-11-15 22:45:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:49,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:49,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,014 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:49,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:49,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:49,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:49,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:49,067 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:49,068 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:45:49,165 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-11-15 22:45:49,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 22:45:49,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:49,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 22:45:49,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-15 22:45:49,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-15 22:45:49,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 22:45:49,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-15 22:45:49,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-15 22:45:49,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-15 22:45:49,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-15 22:45:49,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:49,187 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-15 22:45:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-15 22:45:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-15 22:45:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:45:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-15 22:45:49,192 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-15 22:45:49,193 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-15 22:45:49,193 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:45:49,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-15 22:45:49,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:45:49,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:49,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:49,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-15 22:45:49,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-15 22:45:49,198 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-11-15 22:45:49,198 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-11-15 22:45:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-15 22:45:49,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:49,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156977164] [2019-11-15 22:45:49,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:45:49,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156977164] [2019-11-15 22:45:49,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079379061] [2019-11-15 22:45:49,247 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:49,314 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 22:45:49,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:45:49,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:49,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:45:49,319 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:45:49,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-15 22:45:49,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509352754] [2019-11-15 22:45:49,319 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:45:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-15 22:45:49,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:49,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304564131] [2019-11-15 22:45:49,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:49,336 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:49,401 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:49,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:49,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:49,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:49,401 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:49,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:49,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:49,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:49,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-11-15 22:45:49,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:49,402 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:49,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,487 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:49,487 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:49,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:49,497 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-11-15 22:45:49,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:49,503 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:49,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:49,510 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:49,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:49,525 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-11-15 22:45:49,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:49,625 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:49,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:49,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:49,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:49,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:49,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:49,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:49,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:49,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2019-11-15 22:45:49,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:49,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:49,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:49,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:49,704 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:49,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:49,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:49,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:49,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:49,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:49,707 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:49,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:49,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:49,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:49,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:49,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:49,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:49,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:49,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:49,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:49,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:49,717 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:49,719 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:49,720 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:49,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:49,720 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:49,721 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:49,721 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:49,722 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:49,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:49,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:49,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:49,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:49,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:45:49,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-15 22:45:49,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 65 states and 87 transitions. Complement of second has 9 states. [2019-11-15 22:45:49,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 22:45:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 22:45:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:45:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-15 22:45:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:49,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2019-11-15 22:45:49,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:45:49,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2019-11-15 22:45:49,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 22:45:49,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-15 22:45:49,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-11-15 22:45:49,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:49,900 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-11-15 22:45:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-11-15 22:45:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-11-15 22:45:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 22:45:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2019-11-15 22:45:49,915 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-11-15 22:45:49,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:45:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:45:49,916 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2019-11-15 22:45:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:49,952 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-11-15 22:45:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:45:49,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-11-15 22:45:49,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:45:49,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2019-11-15 22:45:49,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-15 22:45:49,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-15 22:45:49,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-15 22:45:49,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:49,956 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 22:45:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-15 22:45:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-11-15 22:45:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 22:45:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-15 22:45:49,959 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 22:45:49,959 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 22:45:49,959 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:45:49,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-15 22:45:49,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:45:49,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:49,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:49,961 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-15 22:45:49,961 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-15 22:45:49,961 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-11-15 22:45:49,961 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-11-15 22:45:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-15 22:45:49,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:49,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135849165] [2019-11-15 22:45:49,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:49,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-15 22:45:49,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:49,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615808946] [2019-11-15 22:45:49,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:49,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:50,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-15 22:45:50,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:50,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138110512] [2019-11-15 22:45:50,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:50,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:50,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:50,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138110512] [2019-11-15 22:45:50,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562982764] [2019-11-15 22:45:50,099 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:45:50,206 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:45:50,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-15 22:45:50,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214311968] [2019-11-15 22:45:50,280 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:50,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:50,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:50,281 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:50,281 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:50,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:50,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:50,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:50,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-11-15 22:45:50,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:50,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:50,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,351 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:50,351 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:50,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:50,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:50,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:50,363 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:50,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:50,370 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:50,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:50,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:50,469 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:50,471 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:50,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:50,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:50,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:50,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:50,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:50,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:50,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:50,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration8_Loop [2019-11-15 22:45:50,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:50,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:50,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:50,575 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:50,575 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:50,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:50,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:50,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:50,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:50,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:50,578 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:50,578 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:50,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:50,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:50,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:50,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:50,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:50,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:50,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:50,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:50,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:50,586 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:50,588 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:50,588 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:50,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:50,589 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:50,589 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:50,589 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:50,589 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:50,660 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:45:50,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:45:50,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-15 22:45:50,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-15 22:45:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 22:45:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:50,713 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:50,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:45:50,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:45:50,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-15 22:45:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-15 22:45:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 22:45:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:50,817 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:50,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:50,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:50,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:45:50,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:45:50,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-11-15 22:45:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-15 22:45:50,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 22:45:50,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:50,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-15 22:45:50,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:50,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-15 22:45:50,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:50,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-15 22:45:50,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-15 22:45:50,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-15 22:45:50,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-15 22:45:50,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-15 22:45:50,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-15 22:45:50,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:50,926 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-15 22:45:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-15 22:45:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-15 22:45:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 22:45:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-15 22:45:50,931 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-15 22:45:50,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:45:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:45:50,932 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-15 22:45:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:51,124 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-15 22:45:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:45:51,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-15 22:45:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-15 22:45:51,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-15 22:45:51,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-15 22:45:51,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:45:51,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-15 22:45:51,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:51,131 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-15 22:45:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-15 22:45:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-15 22:45:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:45:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 22:45:51,136 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 22:45:51,136 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 22:45:51,137 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:45:51,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-15 22:45:51,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 22:45:51,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:51,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:51,138 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:51,138 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-15 22:45:51,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-11-15 22:45:51,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-11-15 22:45:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-15 22:45:51,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:51,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712351505] [2019-11-15 22:45:51,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-15 22:45:51,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:51,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498308874] [2019-11-15 22:45:51,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:45:51,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498308874] [2019-11-15 22:45:51,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:51,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:45:51,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918392915] [2019-11-15 22:45:51,171 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:45:51,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:51,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:51,172 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 22:45:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:51,180 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-15 22:45:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:51,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-15 22:45:51,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:45:51,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-15 22:45:51,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:45:51,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:45:51,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-15 22:45:51,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:51,184 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-15 22:45:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-15 22:45:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-15 22:45:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:45:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-15 22:45:51,186 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-15 22:45:51,186 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-15 22:45:51,186 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:45:51,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-15 22:45:51,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 22:45:51,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:51,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:51,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:51,187 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-15 22:45:51,187 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-11-15 22:45:51,187 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-11-15 22:45:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-15 22:45:51,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:51,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842120170] [2019-11-15 22:45:51,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-15 22:45:51,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:51,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342260864] [2019-11-15 22:45:51,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,207 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-15 22:45:51,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:51,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620846608] [2019-11-15 22:45:51,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:51,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:51,222 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:51,334 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:51,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:51,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:51,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:51,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:51,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:51,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:51,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:51,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-11-15 22:45:51,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:51,335 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:51,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,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-11-15 22:45:51,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:51,396 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:51,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:51,408 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-11-15 22:45:51,413 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:51,414 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:51,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:51,424 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:51,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:51,435 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:51,441 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:51,443 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:51,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:51,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:51,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:51,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:51,444 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:51,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:51,444 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:51,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2019-11-15 22:45:51,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:51,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:51,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:51,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-11-15 22:45:51,522 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:51,522 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:51,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:51,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:51,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:51,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:51,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:51,524 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:51,524 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:51,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:51,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:51,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:51,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:51,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:51,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:51,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:51,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:51,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:51,532 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:51,534 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:51,534 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:51,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:51,535 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:51,535 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:51,535 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:51,536 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:51,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 22:45:51,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:45:51,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-15 22:45:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:51,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:45:51,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:51,630 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:51,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 22:45:51,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:45:51,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-15 22:45:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:45:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:51,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:51,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:51,801 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 22:45:51,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:45:51,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-11-15 22:45:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:51,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:45:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:51,809 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:51,904 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 22:45:51,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:45:51,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-11-15 22:45:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:45:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:45:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:51,943 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:51,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:45:51,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:52,025 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 22:45:52,025 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:45:52,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,105 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,151 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,152 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,152 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,152 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,153 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,154 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,154 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:52,166 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-11-15 22:45:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:45:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-15 22:45:52,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:45:52,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:52,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-15 22:45:52,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:52,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-15 22:45:52,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:52,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-15 22:45:52,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-15 22:45:52,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-15 22:45:52,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-15 22:45:52,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 22:45:52,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-15 22:45:52,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:52,195 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-15 22:45:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-15 22:45:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-15 22:45:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 22:45:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-15 22:45:52,221 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-15 22:45:52,222 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-15 22:45:52,222 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:45:52,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-15 22:45:52,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-15 22:45:52,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:52,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:52,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:52,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-15 22:45:52,224 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-11-15 22:45:52,224 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-11-15 22:45:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-15 22:45:52,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:52,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724929931] [2019-11-15 22:45:52,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,232 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-15 22:45:52,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:52,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80764688] [2019-11-15 22:45:52,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-15 22:45:52,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:52,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867202379] [2019-11-15 22:45:52,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:52,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:52,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:52,422 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-15 22:45:52,435 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:52,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:52,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:52,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:52,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:52,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:52,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:52,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:52,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-11-15 22:45:52,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:52,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:52,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,530 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:52,530 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:52,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:52,536 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:52,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:52,550 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:52,560 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:52,562 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:52,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:52,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:52,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:52,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:52,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:52,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:52,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:52,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2019-11-15 22:45:52,563 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:52,563 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:52,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:52,630 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:52,630 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:52,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:52,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:52,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:52,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:52,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:52,633 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:52,633 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:52,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:52,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:52,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:52,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:52,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:52,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:52,637 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:52,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:52,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:52,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:52,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:52,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:52,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:52,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:52,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:52,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:52,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:52,645 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:52,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:52,647 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:52,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:52,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:52,648 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:52,649 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:52,649 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:52,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:45:52,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-15 22:45:52,798 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-15 22:45:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:45:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:52,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 22:45:52,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:52,801 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:52,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:45:52,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-15 22:45:52,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-15 22:45:52,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:45:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:52,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 22:45:52,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:52,943 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:52,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:45:52,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:53,049 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:45:53,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-15 22:45:53,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-11-15 22:45:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:45:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:53,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 22:45:53,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:53,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:53,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:53,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:53,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:45:53,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:53,203 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:45:53,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-15 22:45:53,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-11-15 22:45:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:45:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:45:53,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 22:45:53,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:53,246 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:53,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:53,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:53,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:45:53,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:53,350 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:45:53,350 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-15 22:45:53,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,423 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,425 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,499 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,499 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,589 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,591 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,591 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,591 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,592 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,592 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,597 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,598 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,599 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,599 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,599 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,600 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,601 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,601 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,601 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,602 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,602 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,602 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,603 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,604 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:53,643 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-11-15 22:45:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:45:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-15 22:45:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 22:45:53,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:53,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-15 22:45:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-15 22:45:53,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:53,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-15 22:45:53,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-15 22:45:53,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-15 22:45:53,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:45:53,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 22:45:53,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-15 22:45:53,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:53,688 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-15 22:45:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-15 22:45:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-15 22:45:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:45:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-15 22:45:53,725 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-15 22:45:53,725 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-15 22:45:53,725 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:45:53,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-15 22:45:53,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-15 22:45:53,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:53,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:53,728 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:53,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-15 22:45:53,729 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-11-15 22:45:53,729 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-11-15 22:45:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-15 22:45:53,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:53,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354981341] [2019-11-15 22:45:53,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-15 22:45:53,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:53,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698817442] [2019-11-15 22:45:53,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,751 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-15 22:45:53,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:53,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321215746] [2019-11-15 22:45:53,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:53,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:53,767 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:53,977 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-15 22:45:54,003 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:54,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:54,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:54,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:54,004 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:54,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:54,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:54,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:54,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-11-15 22:45:54,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:54,004 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:54,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:54,095 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:54,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:54,100 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:54,106 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:54,106 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:54,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:54,117 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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) [2019-11-15 22:45:54,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:54,133 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:54,148 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:54,150 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:54,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:54,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:54,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:54,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:54,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:54,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:54,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:54,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration12_Loop [2019-11-15 22:45:54,152 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:54,152 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:54,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-11-15 22:45:54,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:54,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-11-15 22:45:54,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:54,249 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:54,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:54,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:54,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:54,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:54,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:54,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:54,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:54,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:54,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:54,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:54,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:54,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:54,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:54,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:54,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:54,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:54,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:54,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:54,258 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:54,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:54,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:54,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:54,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:54,259 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:54,260 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:54,262 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:54,262 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:54,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:54,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:54,263 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:54,263 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:54,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:54,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:45:54,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-15 22:45:54,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-15 22:45:54,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:54,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-15 22:45:54,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:54,467 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:54,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:45:54,626 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-15 22:45:54,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-15 22:45:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-15 22:45:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:54,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:54,813 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:45:54,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-15 22:45:54,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 392 states and 537 transitions. Complement of second has 4 states. [2019-11-15 22:45:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:54,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-15 22:45:54,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:54,832 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:54,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:45:54,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:55,029 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:45:55,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-15 22:45:55,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 455 states and 606 transitions. Complement of second has 8 states. [2019-11-15 22:45:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:45:55,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-15 22:45:55,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:55,078 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:55,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:55,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:55,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:45:55,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:55,269 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 22:45:55,270 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-11-15 22:45:55,344 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,347 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,347 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,348 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,348 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,349 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,350 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,350 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,351 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,351 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,352 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,352 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,353 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,353 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,354 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,355 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,356 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,356 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,417 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,423 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,423 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,423 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,424 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,426 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,427 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,428 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,431 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,431 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,433 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,434 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,438 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,441 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,505 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,525 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,526 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,527 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,528 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,529 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,530 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,532 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,533 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,534 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,535 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,536 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,537 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,632 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,633 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,635 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,636 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,637 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,638 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,639 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,640 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,641 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,642 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,643 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,645 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,646 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,647 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,649 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,650 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,651 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,652 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,653 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,654 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,655 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,656 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,657 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:55,690 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. Result 5484 states and 8953 transitions. Complement of second has 178 states 20 powerset states158 rank states. The highest rank that occured is 7 [2019-11-15 22:45:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:45:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2019-11-15 22:45:55,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-15 22:45:55,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:55,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-15 22:45:55,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:55,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-15 22:45:55,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:55,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2019-11-15 22:45:55,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-15 22:45:55,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2019-11-15 22:45:55,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 22:45:55,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:45:55,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2019-11-15 22:45:55,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:55,771 INFO L688 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2019-11-15 22:45:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2019-11-15 22:45:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2019-11-15 22:45:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-15 22:45:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2019-11-15 22:45:55,799 INFO L711 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-11-15 22:45:55,799 INFO L591 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-11-15 22:45:55,799 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 22:45:55,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2019-11-15 22:45:55,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 22:45:55,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:55,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:55,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:55,806 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2019-11-15 22:45:55,806 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-11-15 22:45:55,806 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-11-15 22:45:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2019-11-15 22:45:55,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:55,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689285879] [2019-11-15 22:45:55,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,816 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2019-11-15 22:45:55,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:55,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082176052] [2019-11-15 22:45:55,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,836 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2019-11-15 22:45:55,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:55,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610030330] [2019-11-15 22:45:55,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:55,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:55,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:56,078 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-11-15 22:45:56,099 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:56,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:56,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:56,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:56,100 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:56,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:56,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:56,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:56,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-11-15 22:45:56,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:56,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:56,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,177 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:56,177 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:56,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:56,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:56,185 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:56,185 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:56,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:56,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:56,195 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:45:56,195 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/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:56,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:56,200 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:56,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:56,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:56,215 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:56,217 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:56,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:56,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:56,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:56,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:56,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:56,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:56,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:56,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration13_Loop [2019-11-15 22:45:56,218 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:56,218 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:56,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:56,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:56,289 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:56,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:56,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:56,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:56,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:56,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:56,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:56,291 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:56,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:56,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:56,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:56,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:56,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:56,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:56,296 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:56,296 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:56,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:56,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:45:56,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:56,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:56,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:56,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:56,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:56,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:56,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:56,302 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:56,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:56,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:56,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:56,305 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:56,305 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:56,305 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:45:56,306 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:56,512 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 22:45:56,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-15 22:45:56,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-11-15 22:45:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:45:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:56,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-15 22:45:56,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:56,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:56,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 22:45:56,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-15 22:45:56,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-11-15 22:45:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:45:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:56,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-15 22:45:56,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:56,773 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:56,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:45:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:57,012 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 22:45:57,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-15 22:45:57,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 996 states and 1456 transitions. Complement of second has 4 states. [2019-11-15 22:45:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:45:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 22:45:57,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-15 22:45:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:57,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:57,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:57,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:57,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:45:57,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:57,230 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 22:45:57,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-15 22:45:57,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 1149 states and 1623 transitions. Complement of second has 8 states. [2019-11-15 22:45:57,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:45:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:45:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-15 22:45:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:57,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:57,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:57,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:45:57,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:57,459 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-15 22:45:57,459 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-11-15 22:45:57,553 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,556 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,556 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,557 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,557 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,557 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,560 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,560 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,561 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,561 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,564 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,568 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,568 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,568 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,569 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,569 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,570 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,570 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,571 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,571 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,572 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,572 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,572 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,573 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,573 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,573 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,573 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,574 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,575 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,575 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,576 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,576 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,576 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,577 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,577 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,578 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,578 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,578 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,578 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,662 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,663 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,664 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,665 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,666 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,667 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,668 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,668 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,669 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,670 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,671 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,671 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,672 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,673 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,674 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,674 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,674 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,675 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,676 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,676 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,676 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,677 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,677 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,678 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,678 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,679 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,680 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,680 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,680 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,681 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,682 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,682 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,682 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,683 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,683 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,683 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,684 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,684 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,684 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,684 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,685 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,685 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,685 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,685 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,686 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,687 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,688 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,689 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,689 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,692 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,692 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,693 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,693 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,696 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,696 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,696 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,696 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,698 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,698 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,699 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,699 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,702 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,702 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,702 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,702 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,797 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,797 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,797 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,798 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,799 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,800 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,801 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,802 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,803 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,804 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,804 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,804 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,805 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,806 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,806 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,807 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,807 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,808 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,808 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,808 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,808 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,809 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,809 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,809 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,809 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,809 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,810 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,811 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,811 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,811 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,825 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,828 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,828 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,828 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,835 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,836 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,837 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,838 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,839 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,839 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,839 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,839 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,842 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,842 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,842 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,842 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,843 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,843 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,843 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,843 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,844 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,844 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,845 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,847 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,848 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,849 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,849 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,849 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,849 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,849 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,850 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,851 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,851 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,855 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,856 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,857 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,859 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,859 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,859 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,859 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,860 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,861 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,861 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,864 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,864 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,864 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,864 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:57,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,008 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,008 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,009 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,014 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,016 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,017 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,017 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,018 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,018 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,018 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,020 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,020 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,020 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,020 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,021 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,021 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,021 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,021 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,023 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,023 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,023 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,026 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,026 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,026 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,026 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,027 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,027 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,027 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,027 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,028 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,030 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,031 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,031 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,031 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,031 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,032 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,032 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,032 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,032 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,035 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,035 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,036 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,036 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,036 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,036 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,037 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,037 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,037 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,039 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,040 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,040 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,040 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,040 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,041 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,041 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,041 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,041 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,042 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,042 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,042 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,042 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,043 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,044 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,046 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,047 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,048 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,048 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,048 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,048 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,049 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,049 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,051 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,195 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,196 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,196 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,197 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,198 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,198 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,198 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,199 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,199 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,199 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,199 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,200 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,200 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,202 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,202 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,202 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,202 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,203 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,203 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,204 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,204 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,204 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,205 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,205 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,205 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,206 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,206 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,206 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,208 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,208 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,209 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,209 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,209 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,209 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,212 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,212 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,213 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,213 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,213 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,214 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,222 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,224 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,239 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-15 22:45:58,300 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. Result 14845 states and 25888 transitions. Complement of second has 212 states 24 powerset states188 rank states. The highest rank that occured is 7 [2019-11-15 22:45:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:45:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2019-11-15 22:45:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2019-11-15 22:45:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2019-11-15 22:45:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2019-11-15 22:45:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:58,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2019-11-15 22:45:58,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-15 22:45:58,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2019-11-15 22:45:58,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 22:45:58,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:45:58,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2019-11-15 22:45:58,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:58,528 INFO L688 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2019-11-15 22:45:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2019-11-15 22:45:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2019-11-15 22:45:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-11-15 22:45:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2019-11-15 22:45:58,586 INFO L711 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-11-15 22:45:58,586 INFO L591 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-11-15 22:45:58,586 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 22:45:58,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2019-11-15 22:45:58,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-15 22:45:58,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:58,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:58,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-15 22:45:58,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2019-11-15 22:45:58,595 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-11-15 22:45:58,596 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-11-15 22:45:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2019-11-15 22:45:58,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:58,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110161552] [2019-11-15 22:45:58,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,612 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2019-11-15 22:45:58,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:58,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887775325] [2019-11-15 22:45:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2019-11-15 22:45:58,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:58,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133149628] [2019-11-15 22:45:58,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:58,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:58,658 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:58,970 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-11-15 22:45:58,984 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:58,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:58,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:58,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:58,985 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:45:58,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:58,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:58,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:58,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-11-15 22:45:58,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:58,985 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:58,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,065 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:59,065 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:59,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:45:59,071 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d71c213f-2deb-4c36-9023-d6b26778299f/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-11-15 22:45:59,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:45:59,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:45:59,125 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:45:59,126 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:59,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:59,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:59,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:59,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:59,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:59,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:59,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:59,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration14_Loop [2019-11-15 22:45:59,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:59,127 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:59,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:59,186 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:59,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-11-15 22:45:59,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:59,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:59,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:59,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:59,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:59,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:59,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:59,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-11-15 22:45:59,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:59,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:59,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:59,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:59,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:59,192 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:59,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:59,193 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:59,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:59,194 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:59,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:59,195 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:45:59,195 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:59,195 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-15 22:45:59,195 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:45:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:45:59,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 22:45:59,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-15 22:45:59,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-11-15 22:45:59,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:45:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:59,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-15 22:45:59,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,297 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:45:59,376 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 22:45:59,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-15 22:45:59,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-11-15 22:45:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:45:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-15 22:45:59,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-15 22:45:59,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,400 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:45:59,518 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 22:45:59,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-15 22:45:59,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 2364 states and 3787 transitions. Complement of second has 7 states. [2019-11-15 22:45:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:45:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-15 22:45:59,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-15 22:45:59,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,556 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:59,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:45:59,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:45:59,670 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 22:45:59,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-11-15 22:45:59,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 3111 states and 5286 transitions. Complement of second has 12 states. [2019-11-15 22:45:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:45:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-15 22:45:59,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2019-11-15 22:45:59,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2019-11-15 22:45:59,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2019-11-15 22:45:59,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:59,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2019-11-15 22:45:59,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:45:59,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2019-11-15 22:45:59,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:45:59,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:45:59,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:45:59,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:45:59,773 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:59,773 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:59,773 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:59,773 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 22:45:59,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:45:59,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:45:59,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:45:59,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:45:59 BoogieIcfgContainer [2019-11-15 22:45:59,782 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:45:59,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:45:59,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:45:59,783 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:45:59,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:44" (3/4) ... [2019-11-15 22:45:59,792 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:45:59,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:45:59,794 INFO L168 Benchmark]: Toolchain (without parser) took 15830.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 941.1 MB in the beginning and 1.0 GB in the end (delta: -90.9 MB). Peak memory consumption was 198.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:59,795 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:59,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:59,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:59,798 INFO L168 Benchmark]: Boogie Preprocessor took 21.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-11-15 22:45:59,802 INFO L168 Benchmark]: RCFGBuilder took 222.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:59,805 INFO L168 Benchmark]: BuchiAutomizer took 15149.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:59,805 INFO L168 Benchmark]: Witness Printer took 9.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:59,810 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.97 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 21.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 222.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15149.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. * Witness Printer took 9.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 15.0s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 6.6s. Construction of modules took 0.8s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3227 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.4s 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.8s 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: 43ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...