./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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 32bit --witnessprinter.graph.data.programhash 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:05,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:05,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:05,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:05,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:05,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:05,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:05,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:05,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:05,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:05,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:05,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:05,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:05,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:05,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:05,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:05,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:05,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:05,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:05,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:05,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:05,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:05,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:05,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:05,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:05,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:05,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:05,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:05,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:05,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:05,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:05,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:05,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:05,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:05,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:05,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:05,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:05,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:05,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:05,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:05,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:05,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:05,195 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:05,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:05,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:05,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:05,197 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:05,197 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:05,197 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:05,197 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:05,198 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:05,198 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:05,198 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:05,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:05,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:05,199 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:05,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:05,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:05,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:05,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:05,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:05,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:05,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:05,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:05,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:05,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:05,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:05,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:05,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:05,209 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:05,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:05,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:05,210 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:05,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:05,211 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2019-10-22 09:01:05,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:05,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:05,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:05,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:05,268 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:05,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/../../sv-benchmarks/c/systemc/toy1.cil.c [2019-10-22 09:01:05,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/data/cce8e09b2/f38dbc77620c4eeeb089d91226c4685d/FLAG048a37789 [2019-10-22 09:01:05,740 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:05,741 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/sv-benchmarks/c/systemc/toy1.cil.c [2019-10-22 09:01:05,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/data/cce8e09b2/f38dbc77620c4eeeb089d91226c4685d/FLAG048a37789 [2019-10-22 09:01:06,090 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/data/cce8e09b2/f38dbc77620c4eeeb089d91226c4685d [2019-10-22 09:01:06,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:06,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:06,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:06,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:06,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:06,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730d5e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06, skipping insertion in model container [2019-10-22 09:01:06,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:06,156 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:06,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:06,493 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:06,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:06,565 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:06,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06 WrapperNode [2019-10-22 09:01:06,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:06,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:06,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:06,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:06,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:06,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:06,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:06,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:06,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... [2019-10-22 09:01:06,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:06,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:06,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:06,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:06,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:06,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:07,363 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:07,364 INFO L284 CfgBuilder]: Removed 28 assume(true) statements. [2019-10-22 09:01:07,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:07 BoogieIcfgContainer [2019-10-22 09:01:07,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:07,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:07,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:07,369 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:07,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:07,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:06" (1/3) ... [2019-10-22 09:01:07,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45c875af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:07, skipping insertion in model container [2019-10-22 09:01:07,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:07,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:06" (2/3) ... [2019-10-22 09:01:07,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45c875af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:07, skipping insertion in model container [2019-10-22 09:01:07,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:07,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:07" (3/3) ... [2019-10-22 09:01:07,374 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2019-10-22 09:01:07,420 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:07,421 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:07,421 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:07,421 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:07,421 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:07,421 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:07,421 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:07,421 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:07,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-10-22 09:01:07,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:01:07,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,474 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:07,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-10-22 09:01:07,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:01:07,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,489 INFO L791 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 29#L406true assume !(1 == ~c_req_up~0); 16#L406-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 31#L417-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 49#L422-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 72#L427-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 93#L432-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 106#L437-1true assume !(0 == ~e_f~0); 3#L442-1true assume !(0 == ~e_g~0); 33#L447-1true assume !(0 == ~e_e~0); 54#L452-1true assume !(0 == ~e_c~0); 77#L457-1true assume !(0 == ~e_wl~0); 97#L462-1true assume !(1 == ~wl_pc~0); 67#L474true assume !(2 == ~wl_pc~0); 21#L475true assume !(1 == ~c1_pc~0); 65#L485true assume !(1 == ~c2_pc~0); 24#L494true assume !(1 == ~wb_pc~0); 118#L503true assume !(1 == ~e_c~0); 90#L512-1true assume !(1 == ~e_e~0); 94#L517-1true assume !(1 == ~e_f~0); 122#L522-1true assume !(1 == ~e_g~0); 25#L527-1true assume !(1 == ~e_c~0); 46#L532-1true assume !(1 == ~e_wl~0); 101#L674-1true [2019-10-22 09:01:07,489 INFO L793 eck$LassoCheckResult]: Loop: 101#L674-1true assume !false; 10#L544true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 126#L379true assume !true; 30#L395true start_simulation_~kernel_st~0 := 2; 112#L550true assume !(1 == ~c_req_up~0); 95#L550-2true start_simulation_~kernel_st~0 := 3; 62#L562true assume 0 == ~e_f~0;~e_f~0 := 1; 64#L562-2true assume 0 == ~e_g~0;~e_g~0 := 1; 87#L567-1true assume 0 == ~e_e~0;~e_e~0 := 1; 114#L572-1true assume !(0 == ~e_c~0); 11#L577-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 41#L582-1true assume 1 == ~wl_pc~0; 8#L588true assume 1 == ~e_wl~0;~wl_st~0 := 0; 61#L595true assume !(1 == ~c1_pc~0); 108#L605true assume !(1 == ~c2_pc~0); 80#L614true assume !(1 == ~wb_pc~0); 51#L623true assume 1 == ~e_c~0;~r_st~0 := 0; 6#L632-1true assume 1 == ~e_e~0;~e_e~0 := 2; 38#L637-1true assume 1 == ~e_f~0;~e_f~0 := 2; 58#L642-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L647-1true assume !(1 == ~e_c~0); 103#L652-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 129#L657-1true assume 0 == ~wl_st~0; 101#L674-1true [2019-10-22 09:01:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-10-22 09:01:07,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353957252] [2019-10-22 09:01:07,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353957252] [2019-10-22 09:01:07,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84987903] [2019-10-22 09:01:07,642 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2019-10-22 09:01:07,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269411700] [2019-10-22 09:01:07,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269411700] [2019-10-22 09:01:07,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:07,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290543672] [2019-10-22 09:01:07,654 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:07,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:07,670 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2019-10-22 09:01:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:07,687 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2019-10-22 09:01:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:07,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2019-10-22 09:01:07,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:07,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2019-10-22 09:01:07,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-10-22 09:01:07,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-10-22 09:01:07,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2019-10-22 09:01:07,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:07,709 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-10-22 09:01:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2019-10-22 09:01:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-22 09:01:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 09:01:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2019-10-22 09:01:07,747 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-10-22 09:01:07,752 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-10-22 09:01:07,752 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:07,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2019-10-22 09:01:07,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:07,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,760 INFO L791 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 292#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 293#L406 assume !(1 == ~c_req_up~0); 294#L406-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 295#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 318#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 341#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 363#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 376#L437-1 assume !(0 == ~e_f~0); 263#L442-1 assume !(0 == ~e_g~0); 264#L447-1 assume !(0 == ~e_e~0); 321#L452-1 assume !(0 == ~e_c~0); 346#L457-1 assume !(0 == ~e_wl~0); 366#L462-1 assume !(1 == ~wl_pc~0); 360#L474 assume !(2 == ~wl_pc~0); 303#L475 assume !(1 == ~c1_pc~0); 299#L485 assume !(1 == ~c2_pc~0); 308#L494 assume !(1 == ~wb_pc~0); 309#L503 assume !(1 == ~e_c~0); 373#L512-1 assume !(1 == ~e_e~0); 374#L517-1 assume !(1 == ~e_f~0); 377#L522-1 assume !(1 == ~e_g~0); 311#L527-1 assume !(1 == ~e_c~0); 312#L532-1 assume !(1 == ~e_wl~0); 267#L674-1 [2019-10-22 09:01:07,761 INFO L793 eck$LassoCheckResult]: Loop: 267#L674-1 assume !false; 281#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 282#L379 assume !false; 372#L297 assume !(0 == ~wl_st~0); 340#L301 assume !(0 == ~c1_st~0); 331#L304 assume !(0 == ~c2_st~0); 297#L307 assume !(0 == ~wb_st~0); 278#L310 assume !(0 == ~r_st~0); 280#L395 start_simulation_~kernel_st~0 := 2; 317#L550 assume !(1 == ~c_req_up~0); 359#L550-2 start_simulation_~kernel_st~0 := 3; 353#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 354#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 357#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 371#L572-1 assume !(0 == ~e_c~0); 283#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L582-1 assume 1 == ~wl_pc~0; 275#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 276#L595 assume !(1 == ~c1_pc~0); 352#L605 assume !(1 == ~c2_pc~0); 327#L614 assume !(1 == ~wb_pc~0); 344#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 270#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 271#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 328#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 350#L647-1 assume !(1 == ~e_c~0); 368#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 380#L657-1 assume 0 == ~wl_st~0; 267#L674-1 [2019-10-22 09:01:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-10-22 09:01:07,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426323794] [2019-10-22 09:01:07,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426323794] [2019-10-22 09:01:07,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827953233] [2019-10-22 09:01:07,827 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 1 times [2019-10-22 09:01:07,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198593608] [2019-10-22 09:01:07,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198593608] [2019-10-22 09:01:07,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175388246] [2019-10-22 09:01:07,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:07,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:07,888 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-10-22 09:01:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:07,908 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2019-10-22 09:01:07,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:07,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2019-10-22 09:01:07,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:07,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2019-10-22 09:01:07,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-10-22 09:01:07,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-10-22 09:01:07,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2019-10-22 09:01:07,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:07,914 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-10-22 09:01:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2019-10-22 09:01:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-22 09:01:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 09:01:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2019-10-22 09:01:07,921 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-10-22 09:01:07,921 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-10-22 09:01:07,922 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:07,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2019-10-22 09:01:07,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:07,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,925 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,925 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,925 INFO L791 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 541#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 542#L406 assume !(1 == ~c_req_up~0); 543#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 544#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 567#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 590#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 612#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 625#L437-1 assume !(0 == ~e_f~0); 512#L442-1 assume !(0 == ~e_g~0); 513#L447-1 assume !(0 == ~e_e~0); 570#L452-1 assume !(0 == ~e_c~0); 595#L457-1 assume !(0 == ~e_wl~0); 615#L462-1 assume !(1 == ~wl_pc~0); 609#L474 assume !(2 == ~wl_pc~0); 552#L475 assume !(1 == ~c1_pc~0); 548#L485 assume !(1 == ~c2_pc~0); 557#L494 assume !(1 == ~wb_pc~0); 558#L503 assume !(1 == ~e_c~0); 622#L512-1 assume !(1 == ~e_e~0); 623#L517-1 assume !(1 == ~e_f~0); 626#L522-1 assume !(1 == ~e_g~0); 560#L527-1 assume !(1 == ~e_c~0); 561#L532-1 assume !(1 == ~e_wl~0); 516#L674-1 [2019-10-22 09:01:07,925 INFO L793 eck$LassoCheckResult]: Loop: 516#L674-1 assume !false; 530#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 531#L379 assume !false; 621#L297 assume !(0 == ~wl_st~0); 589#L301 assume !(0 == ~c1_st~0); 580#L304 assume !(0 == ~c2_st~0); 546#L307 assume !(0 == ~wb_st~0); 527#L310 assume !(0 == ~r_st~0); 529#L395 start_simulation_~kernel_st~0 := 2; 566#L550 assume !(1 == ~c_req_up~0); 608#L550-2 start_simulation_~kernel_st~0 := 3; 602#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 603#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 606#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 620#L572-1 assume !(0 == ~e_c~0); 532#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L582-1 assume 1 == ~wl_pc~0; 524#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 525#L595 assume !(1 == ~c1_pc~0); 601#L605 assume !(1 == ~c2_pc~0); 576#L614 assume !(1 == ~wb_pc~0); 593#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 519#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 520#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 577#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 599#L647-1 assume !(1 == ~e_c~0); 617#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 629#L657-1 assume 0 == ~wl_st~0; 516#L674-1 [2019-10-22 09:01:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-10-22 09:01:07,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000092583] [2019-10-22 09:01:07,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,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-10-22 09:01:07,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000092583] [2019-10-22 09:01:07,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124178634] [2019-10-22 09:01:07,957 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,958 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 2 times [2019-10-22 09:01:07,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068104880] [2019-10-22 09:01:07,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068104880] [2019-10-22 09:01:07,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649337946] [2019-10-22 09:01:07,990 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:07,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:07,990 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-10-22 09:01:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:08,013 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2019-10-22 09:01:08,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:08,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2019-10-22 09:01:08,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:08,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2019-10-22 09:01:08,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-10-22 09:01:08,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-10-22 09:01:08,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2019-10-22 09:01:08,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:08,023 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-10-22 09:01:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2019-10-22 09:01:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-22 09:01:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 09:01:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2019-10-22 09:01:08,031 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-10-22 09:01:08,032 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-10-22 09:01:08,032 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:08,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2019-10-22 09:01:08,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:08,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:08,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:08,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,034 INFO L791 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 790#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 791#L406 assume !(1 == ~c_req_up~0); 792#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 793#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 816#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 839#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 861#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L437-1 assume !(0 == ~e_f~0); 761#L442-1 assume !(0 == ~e_g~0); 762#L447-1 assume !(0 == ~e_e~0); 819#L452-1 assume !(0 == ~e_c~0); 844#L457-1 assume !(0 == ~e_wl~0); 864#L462-1 assume !(1 == ~wl_pc~0); 858#L474 assume !(2 == ~wl_pc~0); 801#L475 assume !(1 == ~c1_pc~0); 797#L485 assume !(1 == ~c2_pc~0); 806#L494 assume !(1 == ~wb_pc~0); 807#L503 assume !(1 == ~e_c~0); 871#L512-1 assume !(1 == ~e_e~0); 872#L517-1 assume !(1 == ~e_f~0); 875#L522-1 assume !(1 == ~e_g~0); 809#L527-1 assume !(1 == ~e_c~0); 810#L532-1 assume !(1 == ~e_wl~0); 765#L674-1 [2019-10-22 09:01:08,035 INFO L793 eck$LassoCheckResult]: Loop: 765#L674-1 assume !false; 779#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 780#L379 assume !false; 870#L297 assume !(0 == ~wl_st~0); 838#L301 assume !(0 == ~c1_st~0); 829#L304 assume !(0 == ~c2_st~0); 795#L307 assume !(0 == ~wb_st~0); 776#L310 assume !(0 == ~r_st~0); 778#L395 start_simulation_~kernel_st~0 := 2; 815#L550 assume !(1 == ~c_req_up~0); 857#L550-2 start_simulation_~kernel_st~0 := 3; 851#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 852#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 855#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 869#L572-1 assume !(0 == ~e_c~0); 781#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L582-1 assume 1 == ~wl_pc~0; 773#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 774#L595 assume !(1 == ~c1_pc~0); 850#L605 assume !(1 == ~c2_pc~0); 825#L614 assume !(1 == ~wb_pc~0); 842#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 768#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 769#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 826#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 848#L647-1 assume !(1 == ~e_c~0); 866#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 878#L657-1 assume 0 == ~wl_st~0; 765#L674-1 [2019-10-22 09:01:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-10-22 09:01:08,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424969994] [2019-10-22 09:01:08,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424969994] [2019-10-22 09:01:08,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:08,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682518628] [2019-10-22 09:01:08,067 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 3 times [2019-10-22 09:01:08,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452485937] [2019-10-22 09:01:08,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452485937] [2019-10-22 09:01:08,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:08,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878634399] [2019-10-22 09:01:08,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:08,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:08,090 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-10-22 09:01:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:08,103 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2019-10-22 09:01:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:08,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2019-10-22 09:01:08,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:08,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2019-10-22 09:01:08,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-10-22 09:01:08,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-10-22 09:01:08,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2019-10-22 09:01:08,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:08,119 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-10-22 09:01:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2019-10-22 09:01:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-22 09:01:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 09:01:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2019-10-22 09:01:08,124 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-10-22 09:01:08,124 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-10-22 09:01:08,124 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:08,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2019-10-22 09:01:08,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 09:01:08,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:08,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:08,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,127 INFO L791 eck$LassoCheckResult]: Stem: 1122#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1039#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1040#L406 assume !(1 == ~c_req_up~0); 1041#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1042#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1065#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1088#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1110#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1123#L437-1 assume !(0 == ~e_f~0); 1010#L442-1 assume !(0 == ~e_g~0); 1011#L447-1 assume !(0 == ~e_e~0); 1068#L452-1 assume !(0 == ~e_c~0); 1093#L457-1 assume !(0 == ~e_wl~0); 1113#L462-1 assume !(1 == ~wl_pc~0); 1107#L474 assume !(2 == ~wl_pc~0); 1050#L475 assume !(1 == ~c1_pc~0); 1046#L485 assume !(1 == ~c2_pc~0); 1055#L494 assume !(1 == ~wb_pc~0); 1056#L503 assume !(1 == ~e_c~0); 1120#L512-1 assume !(1 == ~e_e~0); 1121#L517-1 assume !(1 == ~e_f~0); 1124#L522-1 assume !(1 == ~e_g~0); 1058#L527-1 assume !(1 == ~e_c~0); 1059#L532-1 assume !(1 == ~e_wl~0); 1014#L674-1 [2019-10-22 09:01:08,127 INFO L793 eck$LassoCheckResult]: Loop: 1014#L674-1 assume !false; 1028#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1029#L379 assume !false; 1119#L297 assume !(0 == ~wl_st~0); 1087#L301 assume !(0 == ~c1_st~0); 1078#L304 assume !(0 == ~c2_st~0); 1044#L307 assume !(0 == ~wb_st~0); 1025#L310 assume !(0 == ~r_st~0); 1027#L395 start_simulation_~kernel_st~0 := 2; 1064#L550 assume !(1 == ~c_req_up~0); 1106#L550-2 start_simulation_~kernel_st~0 := 3; 1100#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1101#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1104#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1118#L572-1 assume !(0 == ~e_c~0); 1030#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L582-1 assume !(1 == ~wl_pc~0); 1024#L594 assume !(2 == ~wl_pc~0); 1023#L595 assume !(1 == ~c1_pc~0); 1099#L605 assume !(1 == ~c2_pc~0); 1074#L614 assume !(1 == ~wb_pc~0); 1091#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1017#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1018#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1075#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1097#L647-1 assume !(1 == ~e_c~0); 1115#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1127#L657-1 assume 0 == ~wl_st~0; 1014#L674-1 [2019-10-22 09:01:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-10-22 09:01:08,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682194345] [2019-10-22 09:01:08,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2019-10-22 09:01:08,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144179465] [2019-10-22 09:01:08,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144179465] [2019-10-22 09:01:08,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:08,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308421372] [2019-10-22 09:01:08,218 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:08,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:08,218 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-10-22 09:01:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:08,261 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2019-10-22 09:01:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:08,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2019-10-22 09:01:08,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-10-22 09:01:08,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2019-10-22 09:01:08,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-10-22 09:01:08,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2019-10-22 09:01:08,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2019-10-22 09:01:08,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:08,266 INFO L688 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-10-22 09:01:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2019-10-22 09:01:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-10-22 09:01:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-22 09:01:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2019-10-22 09:01:08,274 INFO L711 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-10-22 09:01:08,274 INFO L591 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-10-22 09:01:08,274 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:08,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2019-10-22 09:01:08,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-10-22 09:01:08,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:08,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:08,277 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,277 INFO L791 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1319#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1320#L406 assume !(1 == ~c_req_up~0); 1321#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1322#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1345#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1369#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1393#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1407#L437-1 assume !(0 == ~e_f~0); 1293#L442-1 assume !(0 == ~e_g~0); 1294#L447-1 assume !(0 == ~e_e~0); 1348#L452-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1375#L457-1 assume !(0 == ~e_wl~0); 1396#L462-1 assume !(1 == ~wl_pc~0); 1390#L474 assume !(2 == ~wl_pc~0); 1330#L475 assume !(1 == ~c1_pc~0); 1326#L485 assume !(1 == ~c2_pc~0); 1335#L494 assume !(1 == ~wb_pc~0); 1336#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 1416#L512-1 assume !(1 == ~e_e~0); 1408#L517-1 assume !(1 == ~e_f~0); 1409#L522-1 assume !(1 == ~e_g~0); 1338#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1339#L532-1 assume !(1 == ~e_wl~0); 1292#L674-1 [2019-10-22 09:01:08,277 INFO L793 eck$LassoCheckResult]: Loop: 1292#L674-1 assume !false; 1308#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1309#L379 assume !false; 1403#L297 assume !(0 == ~wl_st~0); 1368#L301 assume !(0 == ~c1_st~0); 1359#L304 assume !(0 == ~c2_st~0); 1324#L307 assume !(0 == ~wb_st~0); 1305#L310 assume !(0 == ~r_st~0); 1307#L395 start_simulation_~kernel_st~0 := 2; 1344#L550 assume !(1 == ~c_req_up~0); 1389#L550-2 start_simulation_~kernel_st~0 := 3; 1383#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1384#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1387#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1402#L572-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L582-1 assume 1 == ~wl_pc~0; 1440#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L595 assume !(1 == ~c1_pc~0); 1436#L605 assume !(1 == ~c2_pc~0); 1398#L614 assume !(1 == ~wb_pc~0); 1372#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1373#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1355#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1356#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1378#L647-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1397#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1412#L657-1 assume 0 == ~wl_st~0; 1292#L674-1 [2019-10-22 09:01:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2019-10-22 09:01:08,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689952063] [2019-10-22 09:01:08,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689952063] [2019-10-22 09:01:08,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:08,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080537529] [2019-10-22 09:01:08,325 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2019-10-22 09:01:08,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586092649] [2019-10-22 09:01:08,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,341 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:08,472 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-22 09:01:08,578 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:08,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:08,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:08,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:08,580 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:08,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:08,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:08,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:08,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2019-10-22 09:01:08,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:08,581 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:08,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,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-10-22 09:01:08,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-10-22 09:01:08,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:09,101 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:09,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:09,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:09,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:09,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:09,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:09,134 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:09,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:09,146 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 [2019-10-22 09:01:09,163 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:09,165 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:09,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:09,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:09,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:09,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:09,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:09,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:09,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:09,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2019-10-22 09:01:09,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:09,167 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:09,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,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-10-22 09:01:09,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-10-22 09:01:09,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:09,596 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:09,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:09,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:09,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:09,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:09,602 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:09,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:09,604 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:09,604 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:09,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:09,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:09,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:09,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:09,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:09,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:09,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:09,613 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:09,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:09,619 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:09,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:09,623 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:01:09,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:09,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:09,626 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:09,627 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-10-22 09:01:09,630 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:09,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:09,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:09,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:09,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:09,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:01:09,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-10-22 09:01:09,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 474 states and 835 transitions. Complement of second has 5 states. [2019-10-22 09:01:09,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2019-10-22 09:01:09,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2019-10-22 09:01:09,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:09,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2019-10-22 09:01:09,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:09,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2019-10-22 09:01:09,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:09,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2019-10-22 09:01:09,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2019-10-22 09:01:09,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2019-10-22 09:01:09,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2019-10-22 09:01:09,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2019-10-22 09:01:09,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2019-10-22 09:01:09,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:09,972 INFO L688 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2019-10-22 09:01:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2019-10-22 09:01:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2019-10-22 09:01:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-22 09:01:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2019-10-22 09:01:09,999 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2019-10-22 09:01:10,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:10,001 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand 4 states. [2019-10-22 09:01:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:10,115 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2019-10-22 09:01:10,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:10,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2019-10-22 09:01:10,121 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-10-22 09:01:10,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2019-10-22 09:01:10,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2019-10-22 09:01:10,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2019-10-22 09:01:10,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2019-10-22 09:01:10,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:10,130 INFO L688 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2019-10-22 09:01:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2019-10-22 09:01:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2019-10-22 09:01:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-22 09:01:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2019-10-22 09:01:10,163 INFO L711 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-10-22 09:01:10,163 INFO L591 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-10-22 09:01:10,165 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:10,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2019-10-22 09:01:10,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-10-22 09:01:10,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:10,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:10,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:10,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:10,172 INFO L791 eck$LassoCheckResult]: Stem: 3323#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3145#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3146#L406 assume !(1 == ~c_req_up~0); 3147#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3148#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3189#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3379#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3324#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3325#L437-1 assume !(0 == ~e_f~0); 3088#L442-1 assume !(0 == ~e_g~0); 3089#L447-1 assume !(0 == ~e_e~0); 3194#L452-1 assume !(0 == ~e_c~0); 3255#L457-1 assume !(0 == ~e_wl~0); 3373#L462-1 assume !(1 == ~wl_pc~0); 3371#L474 assume !(2 == ~wl_pc~0); 3370#L475 assume !(1 == ~c1_pc~0); 3411#L485 assume !(1 == ~c2_pc~0); 3409#L494 assume !(1 == ~wb_pc~0); 3407#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 3321#L512-1 assume !(1 == ~e_e~0); 3322#L517-1 assume !(1 == ~e_f~0); 3326#L522-1 assume !(1 == ~e_g~0); 3176#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3177#L532-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3092#L674-1 [2019-10-22 09:01:10,172 INFO L793 eck$LassoCheckResult]: Loop: 3092#L674-1 assume !false; 3336#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3646#L379 assume !false; 3645#L297 assume !(0 == ~wl_st~0); 3644#L301 assume !(0 == ~c1_st~0); 3214#L304 assume !(0 == ~c2_st~0); 3151#L307 assume !(0 == ~wb_st~0); 3153#L310 assume !(0 == ~r_st~0); 3639#L395 start_simulation_~kernel_st~0 := 2; 3637#L550 assume !(1 == ~c_req_up~0); 3327#L550-2 start_simulation_~kernel_st~0 := 3; 3328#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 3283#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3284#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3315#L572-1 assume !(0 == ~e_c~0); 3492#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3491#L582-1 assume 1 == ~wl_pc~0; 3489#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3488#L595 assume !(1 == ~c1_pc~0); 3481#L605 assume !(1 == ~c2_pc~0); 3475#L614 assume !(1 == ~wb_pc~0); 3471#L623 assume !(1 == ~e_c~0); 3468#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3465#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3462#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3459#L647-1 assume !(1 == ~e_c~0); 3306#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3356#L657-1 assume 0 == ~wl_st~0; 3092#L674-1 [2019-10-22 09:01:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2019-10-22 09:01:10,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:10,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726067633] [2019-10-22 09:01:10,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:10,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726067633] [2019-10-22 09:01:10,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:10,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:10,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605440288] [2019-10-22 09:01:10,255 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2018715509, now seen corresponding path program 1 times [2019-10-22 09:01:10,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:10,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874189285] [2019-10-22 09:01:10,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:10,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:10,390 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:10,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:10,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:10,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:10,390 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:10,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:10,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:10,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2019-10-22 09:01:10,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:10,391 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:10,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,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-10-22 09:01:10,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,704 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:10,705 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,718 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:10,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,723 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:10,744 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,744 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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) [2019-10-22 09:01:10,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,753 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,758 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,758 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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) [2019-10-22 09:01:10,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,767 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,771 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,771 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:10,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,779 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,786 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:10,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:10,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:10,808 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:10,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:10,835 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:10,837 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:10,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:10,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:10,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:10,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:10,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:10,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:10,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2019-10-22 09:01:10,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:10,838 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:10,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,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-10-22 09:01:10,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:11,142 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:11,142 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:11,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,149 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:11,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,149 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:11,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,156 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:11,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,157 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:11,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,173 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:11,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,174 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:11,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,180 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:11,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,181 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:11,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,190 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,191 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,193 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:11,200 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:11,200 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:01:11,201 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:11,201 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:11,201 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:11,201 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2019-10-22 09:01:11,202 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:11,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:11,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:11,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:01:11,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand 5 states. [2019-10-22 09:01:11,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 1027 states and 1790 transitions. Complement of second has 5 states. [2019-10-22 09:01:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2019-10-22 09:01:11,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2019-10-22 09:01:11,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:11,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2019-10-22 09:01:11,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:11,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2019-10-22 09:01:11,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:11,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1027 states and 1790 transitions. [2019-10-22 09:01:11,374 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 573 [2019-10-22 09:01:11,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1027 states to 1021 states and 1780 transitions. [2019-10-22 09:01:11,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2019-10-22 09:01:11,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2019-10-22 09:01:11,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1780 transitions. [2019-10-22 09:01:11,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:11,385 INFO L688 BuchiCegarLoop]: Abstraction has 1021 states and 1780 transitions. [2019-10-22 09:01:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1780 transitions. [2019-10-22 09:01:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 818. [2019-10-22 09:01:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-10-22 09:01:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1432 transitions. [2019-10-22 09:01:11,404 INFO L711 BuchiCegarLoop]: Abstraction has 818 states and 1432 transitions. [2019-10-22 09:01:11,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:11,405 INFO L87 Difference]: Start difference. First operand 818 states and 1432 transitions. Second operand 3 states. [2019-10-22 09:01:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:11,481 INFO L93 Difference]: Finished difference Result 1080 states and 1855 transitions. [2019-10-22 09:01:11,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:11,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1080 states and 1855 transitions. [2019-10-22 09:01:11,491 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-10-22 09:01:11,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1080 states to 1080 states and 1855 transitions. [2019-10-22 09:01:11,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2019-10-22 09:01:11,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2019-10-22 09:01:11,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1855 transitions. [2019-10-22 09:01:11,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:11,501 INFO L688 BuchiCegarLoop]: Abstraction has 1080 states and 1855 transitions. [2019-10-22 09:01:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1855 transitions. [2019-10-22 09:01:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1076. [2019-10-22 09:01:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-10-22 09:01:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1851 transitions. [2019-10-22 09:01:11,523 INFO L711 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-10-22 09:01:11,523 INFO L591 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-10-22 09:01:11,523 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:11,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1851 transitions. [2019-10-22 09:01:11,528 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-10-22 09:01:11,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:11,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:11,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,530 INFO L791 eck$LassoCheckResult]: Stem: 7037#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6857#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6858#L406 assume !(1 == ~c_req_up~0); 6859#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6860#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6948#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6949#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7002#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7061#L437-1 assume !(0 == ~e_f~0); 7062#L442-1 assume !(0 == ~e_g~0); 6900#L447-1 assume !(0 == ~e_e~0); 6901#L452-1 assume !(0 == ~e_c~0); 7007#L457-1 assume !(0 == ~e_wl~0); 7008#L462-1 assume !(1 == ~wl_pc~0); 6995#L474 assume !(2 == ~wl_pc~0); 6996#L475 assume !(1 == ~c1_pc~0); 7097#L485 assume !(1 == ~c2_pc~0); 6880#L494 assume !(1 == ~wb_pc~0); 6881#L503 assume !(1 == ~e_c~0); 7035#L512-1 assume !(1 == ~e_e~0); 7036#L517-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7105#L522-1 assume !(1 == ~e_g~0); 6883#L527-1 assume !(1 == ~e_c~0); 6884#L532-1 assume !(1 == ~e_wl~0); 7409#L674-1 assume !false; 7410#L544 [2019-10-22 09:01:11,530 INFO L793 eck$LassoCheckResult]: Loop: 7410#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7511#L379 assume !false; 7512#L297 assume !(0 == ~wl_st~0); 7507#L301 assume !(0 == ~c1_st~0); 7508#L304 assume !(0 == ~c2_st~0); 7500#L307 assume !(0 == ~wb_st~0); 7501#L310 assume !(0 == ~r_st~0); 7573#L395 start_simulation_~kernel_st~0 := 2; 7568#L550 assume !(1 == ~c_req_up~0); 7565#L550-2 start_simulation_~kernel_st~0 := 3; 7562#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 7560#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7561#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7556#L572-1 assume !(0 == ~e_c~0); 7557#L577-1 assume !(0 == ~e_wl~0); 7551#L582-1 assume !(1 == ~wl_pc~0); 7552#L594 assume !(2 == ~wl_pc~0); 7547#L595 assume !(1 == ~c1_pc~0); 7546#L605 assume !(1 == ~c2_pc~0); 7539#L614 assume !(1 == ~wb_pc~0); 7540#L623 assume !(1 == ~e_c~0); 7535#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7536#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7528#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7529#L647-1 assume !(1 == ~e_c~0); 7524#L652-1 assume !(1 == ~e_wl~0); 7525#L657-1 assume 0 == ~wl_st~0; 7514#L674-1 assume !false; 7410#L544 [2019-10-22 09:01:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2019-10-22 09:01:11,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990901778] [2019-10-22 09:01:11,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:11,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990901778] [2019-10-22 09:01:11,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:11,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:11,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991453489] [2019-10-22 09:01:11,570 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628252, now seen corresponding path program 1 times [2019-10-22 09:01:11,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570478443] [2019-10-22 09:01:11,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:11,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570478443] [2019-10-22 09:01:11,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:11,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:11,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344520610] [2019-10-22 09:01:11,586 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:11,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:11,587 INFO L87 Difference]: Start difference. First operand 1076 states and 1851 transitions. cyclomatic complexity: 786 Second operand 4 states. [2019-10-22 09:01:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:11,723 INFO L93 Difference]: Finished difference Result 1310 states and 2219 transitions. [2019-10-22 09:01:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:11,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 2219 transitions. [2019-10-22 09:01:11,734 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 623 [2019-10-22 09:01:11,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1310 states and 2219 transitions. [2019-10-22 09:01:11,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2019-10-22 09:01:11,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 778 [2019-10-22 09:01:11,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1310 states and 2219 transitions. [2019-10-22 09:01:11,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:11,744 INFO L688 BuchiCegarLoop]: Abstraction has 1310 states and 2219 transitions. [2019-10-22 09:01:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states and 2219 transitions. [2019-10-22 09:01:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1271. [2019-10-22 09:01:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-10-22 09:01:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2169 transitions. [2019-10-22 09:01:11,772 INFO L711 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-10-22 09:01:11,772 INFO L591 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-10-22 09:01:11,772 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:11,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2169 transitions. [2019-10-22 09:01:11,779 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 620 [2019-10-22 09:01:11,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:11,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:11,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,781 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,781 INFO L791 eck$LassoCheckResult]: Stem: 9429#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9256#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9257#L406 assume !(1 == ~c_req_up~0); 9291#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9296#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9297#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9400#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9401#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9430#L437-1 assume !(0 == ~e_f~0); 9203#L442-1 assume !(0 == ~e_g~0); 9204#L447-1 assume !(0 == ~e_e~0); 9302#L452-1 assume !(0 == ~e_c~0); 9358#L457-1 assume !(0 == ~e_wl~0); 9518#L462-1 assume !(1 == ~wl_pc~0); 9509#L474 assume !(2 == ~wl_pc~0); 9503#L475 assume !(1 == ~c1_pc~0); 9493#L485 assume !(1 == ~c2_pc~0); 9485#L494 assume !(1 == ~wb_pc~0); 9478#L503 assume !(1 == ~e_c~0); 9473#L512-1 assume !(1 == ~e_e~0); 9468#L517-1 assume !(1 == ~e_f~0); 9465#L522-1 assume !(1 == ~e_g~0); 9282#L527-1 assume !(1 == ~e_c~0); 9283#L532-1 assume !(1 == ~e_wl~0); 9341#L674-1 assume !false; 9853#L544 [2019-10-22 09:01:11,781 INFO L793 eck$LassoCheckResult]: Loop: 9853#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 10286#L379 assume !false; 10282#L297 assume !(0 == ~wl_st~0); 10283#L301 assume !(0 == ~c1_st~0); 10285#L304 assume !(0 == ~c2_st~0); 10280#L307 assume !(0 == ~wb_st~0); 10281#L310 assume !(0 == ~r_st~0); 10284#L395 start_simulation_~kernel_st~0 := 2; 10398#L550 assume !(1 == ~c_req_up~0); 10399#L550-2 start_simulation_~kernel_st~0 := 3; 10425#L562 assume !(0 == ~e_f~0); 10424#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10423#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10422#L572-1 assume !(0 == ~e_c~0); 10421#L577-1 assume !(0 == ~e_wl~0); 10419#L582-1 assume !(1 == ~wl_pc~0); 10418#L594 assume !(2 == ~wl_pc~0); 10416#L595 assume !(1 == ~c1_pc~0); 10414#L605 assume !(1 == ~c2_pc~0); 10411#L614 assume !(1 == ~wb_pc~0); 10410#L623 assume !(1 == ~e_c~0); 10409#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9315#L637-1 assume !(1 == ~e_f~0); 9316#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9368#L647-1 assume !(1 == ~e_c~0); 9415#L652-1 assume !(1 == ~e_wl~0); 10318#L657-1 assume 0 == ~wl_st~0; 10297#L674-1 assume !false; 9853#L544 [2019-10-22 09:01:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-10-22 09:01:11,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250618494] [2019-10-22 09:01:11,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 520452640, now seen corresponding path program 1 times [2019-10-22 09:01:11,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888681302] [2019-10-22 09:01:11,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:11,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888681302] [2019-10-22 09:01:11,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:11,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:11,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743745455] [2019-10-22 09:01:11,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:11,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:11,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:11,831 INFO L87 Difference]: Start difference. First operand 1271 states and 2169 transitions. cyclomatic complexity: 909 Second operand 3 states. [2019-10-22 09:01:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:11,872 INFO L93 Difference]: Finished difference Result 1965 states and 3310 transitions. [2019-10-22 09:01:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:11,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1965 states and 3310 transitions. [2019-10-22 09:01:11,886 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-10-22 09:01:11,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-10-22 09:01:11,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1131 [2019-10-22 09:01:11,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1131 [2019-10-22 09:01:11,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1965 states and 3310 transitions. [2019-10-22 09:01:11,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:11,900 INFO L688 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-10-22 09:01:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states and 3310 transitions. [2019-10-22 09:01:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2019-10-22 09:01:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-10-22 09:01:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-10-22 09:01:11,944 INFO L711 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-10-22 09:01:11,944 INFO L591 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-10-22 09:01:11,944 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:11,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1965 states and 3310 transitions. [2019-10-22 09:01:11,954 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-10-22 09:01:11,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:11,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:11,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:11,955 INFO L791 eck$LassoCheckResult]: Stem: 12681#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 12498#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 12499#L406 assume !(1 == ~c_req_up~0); 12534#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12537#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12538#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12651#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12652#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12702#L437-1 assume !(0 == ~e_f~0); 12445#L442-1 assume !(0 == ~e_g~0); 12446#L447-1 assume !(0 == ~e_e~0); 12613#L452-1 assume !(0 == ~e_c~0); 12614#L457-1 assume !(0 == ~e_wl~0); 12657#L462-1 assume !(1 == ~wl_pc~0); 12646#L474 assume !(2 == ~wl_pc~0); 12512#L475 assume !(1 == ~c1_pc~0); 12505#L485 assume !(1 == ~c2_pc~0); 12521#L494 assume !(1 == ~wb_pc~0); 12522#L503 assume !(1 == ~e_c~0); 12712#L512-1 assume !(1 == ~e_e~0); 12729#L517-1 assume !(1 == ~e_f~0); 12715#L522-1 assume !(1 == ~e_g~0); 12524#L527-1 assume !(1 == ~e_c~0); 12525#L532-1 assume !(1 == ~e_wl~0); 12593#L674-1 assume !false; 13019#L544 [2019-10-22 09:01:11,955 INFO L793 eck$LassoCheckResult]: Loop: 13019#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 13534#L379 assume !false; 13582#L297 assume !(0 == ~wl_st~0); 13584#L301 assume !(0 == ~c1_st~0); 13648#L304 assume !(0 == ~c2_st~0); 13649#L307 assume !(0 == ~wb_st~0); 13643#L310 assume !(0 == ~r_st~0); 13645#L395 start_simulation_~kernel_st~0 := 2; 13779#L550 assume !(1 == ~c_req_up~0); 13777#L550-2 start_simulation_~kernel_st~0 := 3; 13774#L562 assume !(0 == ~e_f~0); 13772#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13769#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13766#L572-1 assume !(0 == ~e_c~0); 13764#L577-1 assume !(0 == ~e_wl~0); 13762#L582-1 assume !(1 == ~wl_pc~0); 13760#L594 assume 2 == ~wl_pc~0; 13758#L596 assume 1 == ~e_e~0;~wl_st~0 := 0; 13757#L595 assume !(1 == ~c1_pc~0); 13755#L605 assume !(1 == ~c2_pc~0); 13752#L614 assume !(1 == ~wb_pc~0); 13751#L623 assume !(1 == ~e_c~0); 13750#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13749#L637-1 assume !(1 == ~e_f~0); 13748#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13747#L647-1 assume !(1 == ~e_c~0); 13746#L652-1 assume !(1 == ~e_wl~0); 13744#L657-1 assume 0 == ~wl_st~0; 13743#L674-1 assume !false; 13019#L544 [2019-10-22 09:01:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-10-22 09:01:11,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38011325] [2019-10-22 09:01:11,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1794894215, now seen corresponding path program 1 times [2019-10-22 09:01:11,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566074824] [2019-10-22 09:01:11,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:11,995 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1157500386, now seen corresponding path program 1 times [2019-10-22 09:01:11,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460826783] [2019-10-22 09:01:11,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:12,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460826783] [2019-10-22 09:01:12,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:12,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:12,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957855994] [2019-10-22 09:01:12,182 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-22 09:01:12,227 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:12,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:12,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:12,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:12,227 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:12,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:12,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:12,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:12,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2019-10-22 09:01:12,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:12,228 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:12,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,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-10-22 09:01:12,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,496 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:12,496 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:12,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:12,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:12,505 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:12,505 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:12,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:12,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:12,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:12,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:12,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:12,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:12,522 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:12,522 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/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-10-22 09:01:12,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:12,527 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:12,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:12,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:12,544 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:12,545 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:12,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:12,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:12,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:12,546 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:12,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:12,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:12,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:12,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2019-10-22 09:01:12,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:12,546 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:12,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,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-10-22 09:01:12,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,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-10-22 09:01:12,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,780 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:12,780 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:12,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:12,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:12,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:12,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:12,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:12,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:12,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:12,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:12,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:12,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:12,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:12,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:12,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:12,784 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:12,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:12,785 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:12,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:12,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:12,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:12,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:12,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:12,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:12,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:12,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:12,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:12,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:12,790 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:12,792 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:12,792 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:01:12,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:12,792 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:12,793 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:12,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2019-10-22 09:01:12,793 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:12,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:12,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:12,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:01:12,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356 Second operand 5 states. [2019-10-22 09:01:12,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356. Second operand 5 states. Result 5576 states and 9355 transitions. Complement of second has 5 states. [2019-10-22 09:01:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2019-10-22 09:01:12,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 29 letters. [2019-10-22 09:01:12,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 54 letters. Loop has 29 letters. [2019-10-22 09:01:12,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 58 letters. [2019-10-22 09:01:12,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5576 states and 9355 transitions. [2019-10-22 09:01:12,965 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1920 [2019-10-22 09:01:12,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5576 states to 5576 states and 9355 transitions. [2019-10-22 09:01:12,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2105 [2019-10-22 09:01:12,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2138 [2019-10-22 09:01:12,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5576 states and 9355 transitions. [2019-10-22 09:01:12,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:12,993 INFO L688 BuchiCegarLoop]: Abstraction has 5576 states and 9355 transitions. [2019-10-22 09:01:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states and 9355 transitions. [2019-10-22 09:01:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5543. [2019-10-22 09:01:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5543 states. [2019-10-22 09:01:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9295 transitions. [2019-10-22 09:01:13,086 INFO L711 BuchiCegarLoop]: Abstraction has 5543 states and 9295 transitions. [2019-10-22 09:01:13,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:13,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:13,087 INFO L87 Difference]: Start difference. First operand 5543 states and 9295 transitions. Second operand 3 states. [2019-10-22 09:01:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:13,127 INFO L93 Difference]: Finished difference Result 5023 states and 8398 transitions. [2019-10-22 09:01:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:13,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5023 states and 8398 transitions. [2019-10-22 09:01:13,153 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-10-22 09:01:13,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-10-22 09:01:13,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1932 [2019-10-22 09:01:13,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1932 [2019-10-22 09:01:13,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5023 states and 8398 transitions. [2019-10-22 09:01:13,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:13,179 INFO L688 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-10-22 09:01:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states and 8398 transitions. [2019-10-22 09:01:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5023. [2019-10-22 09:01:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-10-22 09:01:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-10-22 09:01:13,256 INFO L711 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-10-22 09:01:13,256 INFO L591 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-10-22 09:01:13,257 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:13,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5023 states and 8398 transitions. [2019-10-22 09:01:13,270 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-10-22 09:01:13,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:13,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:13,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:13,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:13,271 INFO L791 eck$LassoCheckResult]: Stem: 30991#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 30789#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 30790#L406 assume !(1 == ~c_req_up~0); 30835#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 30839#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 30840#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 30957#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 30958#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 31007#L437-1 assume !(0 == ~e_f~0); 31008#L442-1 assume !(0 == ~e_g~0); 30845#L447-1 assume !(0 == ~e_e~0); 30846#L452-1 assume !(0 == ~e_c~0); 31056#L457-1 assume !(0 == ~e_wl~0); 31055#L462-1 assume !(1 == ~wl_pc~0); 31052#L474 assume !(2 == ~wl_pc~0); 31051#L475 assume !(1 == ~c1_pc~0); 31049#L485 assume !(1 == ~c2_pc~0); 31040#L494 assume !(1 == ~wb_pc~0); 31035#L503 assume !(1 == ~e_c~0); 31031#L512-1 assume !(1 == ~e_e~0); 31026#L517-1 assume !(1 == ~e_f~0); 31025#L522-1 assume !(1 == ~e_g~0); 30826#L527-1 assume !(1 == ~e_c~0); 30827#L532-1 assume !(1 == ~e_wl~0); 31481#L674-1 assume !false; 31476#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 31477#L379 [2019-10-22 09:01:13,271 INFO L793 eck$LassoCheckResult]: Loop: 31477#L379 assume !false; 31493#L297 assume 0 == ~wl_st~0; 31492#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31472#L323 assume !(0 != eval_~tmp~0); 31473#L319 assume !(0 == ~c1_st~0); 31602#L334 assume !(0 == ~c2_st~0); 31575#L349 assume !(0 == ~wb_st~0); 31523#L364 assume !(0 == ~r_st~0); 31477#L379 [2019-10-22 09:01:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-10-22 09:01:13,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311948091] [2019-10-22 09:01:13,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,285 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2019-10-22 09:01:13,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452479050] [2019-10-22 09:01:13,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2019-10-22 09:01:13,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324314130] [2019-10-22 09:01:13,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:13,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324314130] [2019-10-22 09:01:13,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:13,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:13,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905160763] [2019-10-22 09:01:13,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:13,341 INFO L87 Difference]: Start difference. First operand 5023 states and 8398 transitions. cyclomatic complexity: 3408 Second operand 3 states. [2019-10-22 09:01:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:13,408 INFO L93 Difference]: Finished difference Result 7959 states and 13148 transitions. [2019-10-22 09:01:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:13,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7959 states and 13148 transitions. [2019-10-22 09:01:13,441 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-10-22 09:01:13,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-10-22 09:01:13,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3015 [2019-10-22 09:01:13,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3015 [2019-10-22 09:01:13,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7959 states and 13148 transitions. [2019-10-22 09:01:13,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:13,492 INFO L688 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-10-22 09:01:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states and 13148 transitions. [2019-10-22 09:01:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7959. [2019-10-22 09:01:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7959 states. [2019-10-22 09:01:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-10-22 09:01:13,619 INFO L711 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-10-22 09:01:13,619 INFO L591 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-10-22 09:01:13,619 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:01:13,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7959 states and 13148 transitions. [2019-10-22 09:01:13,647 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-10-22 09:01:13,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:13,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:13,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:13,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:13,648 INFO L791 eck$LassoCheckResult]: Stem: 43968#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 43776#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 43777#L406 assume !(1 == ~c_req_up~0); 43820#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43823#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43824#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43941#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43942#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43988#L437-1 assume !(0 == ~e_f~0); 43989#L442-1 assume !(0 == ~e_g~0); 43829#L447-1 assume !(0 == ~e_e~0); 43830#L452-1 assume !(0 == ~e_c~0); 44041#L457-1 assume !(0 == ~e_wl~0); 44040#L462-1 assume !(1 == ~wl_pc~0); 44037#L474 assume !(2 == ~wl_pc~0); 44036#L475 assume !(1 == ~c1_pc~0); 44034#L485 assume !(1 == ~c2_pc~0); 44025#L494 assume !(1 == ~wb_pc~0); 44020#L503 assume !(1 == ~e_c~0); 44016#L512-1 assume !(1 == ~e_e~0); 44011#L517-1 assume !(1 == ~e_f~0); 44010#L522-1 assume !(1 == ~e_g~0); 43810#L527-1 assume !(1 == ~e_c~0); 43811#L532-1 assume !(1 == ~e_wl~0); 44728#L674-1 assume !false; 44729#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 44716#L379 [2019-10-22 09:01:13,648 INFO L793 eck$LassoCheckResult]: Loop: 44716#L379 assume !false; 44634#L297 assume 0 == ~wl_st~0; 44603#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 44596#L323 assume !(0 != eval_~tmp~0); 44597#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 47915#L338 assume !(0 != eval_~tmp___0~0); 44734#L334 assume !(0 == ~c2_st~0); 44732#L349 assume !(0 == ~wb_st~0); 44722#L364 assume !(0 == ~r_st~0); 44716#L379 [2019-10-22 09:01:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-10-22 09:01:13,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953195708] [2019-10-22 09:01:13,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,667 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2019-10-22 09:01:13,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595465859] [2019-10-22 09:01:13,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:13,684 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2019-10-22 09:01:13,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87588461] [2019-10-22 09:01:13,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:13,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87588461] [2019-10-22 09:01:13,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:13,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:13,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452271174] [2019-10-22 09:01:13,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:13,750 INFO L87 Difference]: Start difference. First operand 7959 states and 13148 transitions. cyclomatic complexity: 5222 Second operand 3 states. [2019-10-22 09:01:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:13,840 INFO L93 Difference]: Finished difference Result 12649 states and 20599 transitions. [2019-10-22 09:01:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:13,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12649 states and 20599 transitions. [2019-10-22 09:01:13,983 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-10-22 09:01:14,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-10-22 09:01:14,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4840 [2019-10-22 09:01:14,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4840 [2019-10-22 09:01:14,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12649 states and 20599 transitions. [2019-10-22 09:01:14,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:14,043 INFO L688 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-10-22 09:01:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12649 states and 20599 transitions. [2019-10-22 09:01:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12649 to 12649. [2019-10-22 09:01:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2019-10-22 09:01:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-10-22 09:01:14,230 INFO L711 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-10-22 09:01:14,230 INFO L591 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-10-22 09:01:14,230 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:01:14,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12649 states and 20599 transitions. [2019-10-22 09:01:14,274 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-10-22 09:01:14,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:14,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:14,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,275 INFO L791 eck$LassoCheckResult]: Stem: 64580#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 64392#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 64393#L406 assume !(1 == ~c_req_up~0); 64433#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 64436#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 64437#L422-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 64547#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 64548#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 64598#L437-1 assume !(0 == ~e_f~0); 64599#L442-1 assume !(0 == ~e_g~0); 66129#L447-1 assume !(0 == ~e_e~0); 66128#L452-1 assume !(0 == ~e_c~0); 66127#L457-1 assume !(0 == ~e_wl~0); 66126#L462-1 assume !(1 == ~wl_pc~0); 64660#L474 assume !(2 == ~wl_pc~0); 64661#L475 assume !(1 == ~c1_pc~0); 64656#L485 assume !(1 == ~c2_pc~0); 64655#L494 assume !(1 == ~wb_pc~0); 64643#L503 assume !(1 == ~e_c~0); 64644#L512-1 assume !(1 == ~e_e~0); 64630#L517-1 assume !(1 == ~e_f~0); 64631#L522-1 assume !(1 == ~e_g~0); 64423#L527-1 assume !(1 == ~e_c~0); 64424#L532-1 assume !(1 == ~e_wl~0); 65800#L674-1 assume !false; 65795#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 65796#L379 [2019-10-22 09:01:14,275 INFO L793 eck$LassoCheckResult]: Loop: 65796#L379 assume !false; 65934#L297 assume 0 == ~wl_st~0; 65933#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 65930#L323 assume !(0 != eval_~tmp~0); 65929#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 65888#L338 assume !(0 != eval_~tmp___0~0); 65919#L334 assume !(0 == ~c2_st~0); 65921#L349 assume !(0 == ~wb_st~0); 65901#L364 assume !(0 == ~r_st~0); 65796#L379 [2019-10-22 09:01:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-10-22 09:01:14,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899214309] [2019-10-22 09:01:14,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899214309] [2019-10-22 09:01:14,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:14,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:14,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248739318] [2019-10-22 09:01:14,293 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2019-10-22 09:01:14,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544078363] [2019-10-22 09:01:14,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:14,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:14,339 INFO L87 Difference]: Start difference. First operand 12649 states and 20599 transitions. cyclomatic complexity: 7983 Second operand 3 states. [2019-10-22 09:01:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:14,398 INFO L93 Difference]: Finished difference Result 12547 states and 20414 transitions. [2019-10-22 09:01:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:14,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12547 states and 20414 transitions. [2019-10-22 09:01:14,458 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-10-22 09:01:14,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-10-22 09:01:14,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4741 [2019-10-22 09:01:14,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4741 [2019-10-22 09:01:14,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12547 states and 20414 transitions. [2019-10-22 09:01:14,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:14,514 INFO L688 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-10-22 09:01:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states and 20414 transitions. [2019-10-22 09:01:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 12547. [2019-10-22 09:01:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12547 states. [2019-10-22 09:01:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-10-22 09:01:14,682 INFO L711 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-10-22 09:01:14,682 INFO L591 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-10-22 09:01:14,682 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 09:01:14,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12547 states and 20414 transitions. [2019-10-22 09:01:14,725 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-10-22 09:01:14,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:14,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:14,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,726 INFO L791 eck$LassoCheckResult]: Stem: 89791#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 89595#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 89596#L406 assume !(1 == ~c_req_up~0); 89638#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 89641#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 89642#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89760#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 89761#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 89810#L437-1 assume !(0 == ~e_f~0); 89811#L442-1 assume !(0 == ~e_g~0); 89647#L447-1 assume !(0 == ~e_e~0); 89648#L452-1 assume !(0 == ~e_c~0); 89867#L457-1 assume !(0 == ~e_wl~0); 89866#L462-1 assume !(1 == ~wl_pc~0); 89863#L474 assume !(2 == ~wl_pc~0); 89862#L475 assume !(1 == ~c1_pc~0); 89860#L485 assume !(1 == ~c2_pc~0); 89851#L494 assume !(1 == ~wb_pc~0); 89846#L503 assume !(1 == ~e_c~0); 89842#L512-1 assume !(1 == ~e_e~0); 89837#L517-1 assume !(1 == ~e_f~0); 89836#L522-1 assume !(1 == ~e_g~0); 89628#L527-1 assume !(1 == ~e_c~0); 89629#L532-1 assume !(1 == ~e_wl~0); 91148#L674-1 assume !false; 91149#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 91095#L379 [2019-10-22 09:01:14,726 INFO L793 eck$LassoCheckResult]: Loop: 91095#L379 assume !false; 95831#L297 assume 0 == ~wl_st~0; 95826#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 95824#L323 assume !(0 != eval_~tmp~0); 95822#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91014#L338 assume !(0 != eval_~tmp___0~0); 95820#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91144#L353 assume !(0 != eval_~tmp___1~0); 91105#L349 assume !(0 == ~wb_st~0); 91097#L364 assume !(0 == ~r_st~0); 91095#L379 [2019-10-22 09:01:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-10-22 09:01:14,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575341582] [2019-10-22 09:01:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2019-10-22 09:01:14,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20322066] [2019-10-22 09:01:14,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2019-10-22 09:01:14,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573080560] [2019-10-22 09:01:14,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573080560] [2019-10-22 09:01:14,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:14,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:14,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687215457] [2019-10-22 09:01:14,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:14,817 INFO L87 Difference]: Start difference. First operand 12547 states and 20414 transitions. cyclomatic complexity: 7900 Second operand 3 states. [2019-10-22 09:01:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:14,933 INFO L93 Difference]: Finished difference Result 21409 states and 34276 transitions. [2019-10-22 09:01:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:14,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21409 states and 34276 transitions. [2019-10-22 09:01:15,036 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-10-22 09:01:15,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-10-22 09:01:15,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8025 [2019-10-22 09:01:15,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8025 [2019-10-22 09:01:15,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21409 states and 34276 transitions. [2019-10-22 09:01:15,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:15,133 INFO L688 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-10-22 09:01:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21409 states and 34276 transitions. [2019-10-22 09:01:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21409 to 21409. [2019-10-22 09:01:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21409 states. [2019-10-22 09:01:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-10-22 09:01:15,403 INFO L711 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-10-22 09:01:15,403 INFO L591 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-10-22 09:01:15,403 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 09:01:15,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21409 states and 34276 transitions. [2019-10-22 09:01:15,532 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-10-22 09:01:15,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:15,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:15,533 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:15,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:15,534 INFO L791 eck$LassoCheckResult]: Stem: 123758#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 123558#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 123559#L406 assume !(1 == ~c_req_up~0); 123603#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 123607#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 123608#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 123725#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 123726#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 123775#L437-1 assume !(0 == ~e_f~0); 123776#L442-1 assume !(0 == ~e_g~0); 123613#L447-1 assume !(0 == ~e_e~0); 123614#L452-1 assume !(0 == ~e_c~0); 123847#L457-1 assume !(0 == ~e_wl~0); 123846#L462-1 assume !(1 == ~wl_pc~0); 123843#L474 assume !(2 == ~wl_pc~0); 123842#L475 assume !(1 == ~c1_pc~0); 123840#L485 assume !(1 == ~c2_pc~0); 123831#L494 assume !(1 == ~wb_pc~0); 123826#L503 assume !(1 == ~e_c~0); 123822#L512-1 assume !(1 == ~e_e~0); 123817#L517-1 assume !(1 == ~e_f~0); 123816#L522-1 assume !(1 == ~e_g~0); 123594#L527-1 assume !(1 == ~e_c~0); 123595#L532-1 assume !(1 == ~e_wl~0); 125339#L674-1 assume !false; 125340#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 124987#L379 [2019-10-22 09:01:15,534 INFO L793 eck$LassoCheckResult]: Loop: 124987#L379 assume !false; 124984#L297 assume 0 == ~wl_st~0; 124981#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 124977#L323 assume !(0 != eval_~tmp~0); 124978#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126122#L338 assume !(0 != eval_~tmp___0~0); 125605#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 125560#L353 assume !(0 != eval_~tmp___1~0); 125303#L349 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 125300#L368 assume !(0 != eval_~tmp___2~0); 125299#L364 assume !(0 == ~r_st~0); 124987#L379 [2019-10-22 09:01:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-10-22 09:01:15,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146628193] [2019-10-22 09:01:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2019-10-22 09:01:15,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797737498] [2019-10-22 09:01:15,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2019-10-22 09:01:15,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243176342] [2019-10-22 09:01:15,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,583 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:16,049 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-10-22 09:01:16,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:16 BoogieIcfgContainer [2019-10-22 09:01:16,155 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:16,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:16,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:16,155 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:16,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:07" (3/4) ... [2019-10-22 09:01:16,159 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:16,226 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c200ade3-277a-4def-84d2-dd4dd438f9d7/bin/uautomizer/witness.graphml [2019-10-22 09:01:16,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:16,231 INFO L168 Benchmark]: Toolchain (without parser) took 10137.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.0 MB). Free memory was 945.8 MB in the beginning and 1.3 GB in the end (delta: -343.9 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,231 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:16,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.52 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,232 INFO L168 Benchmark]: Boogie Preprocessor took 53.71 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,232 INFO L168 Benchmark]: RCFGBuilder took 688.81 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,232 INFO L168 Benchmark]: BuchiAutomizer took 8788.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.4 MB). Peak memory consumption was 131.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,233 INFO L168 Benchmark]: Witness Printer took 74.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:16,234 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.52 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.71 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 688.81 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8788.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.4 MB). Peak memory consumption was 131.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 21409 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 21409 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4213 SDtfs, 3526 SDslu, 2462 SDs, 0 SdLazy, 323 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 296]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a909709=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76323c4b=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64a23902=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3958d5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bfe662=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 296]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) [L467] COND FALSE !((int )wl_pc == 1) [L475] COND FALSE !((int )wl_pc == 2) [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; Loop: [L296] COND TRUE 1 [L298] COND TRUE (int )wl_st == 0 [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND FALSE !(\read(tmp)) [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND FALSE !(\read(tmp___0)) [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp___1)) [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND FALSE !(\read(tmp___2)) [L379] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...