./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.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_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/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 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:22,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:22,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:22,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:22,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:22,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:22,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:22,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:22,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:22,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:22,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:22,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:22,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:22,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:22,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:22,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:22,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:22,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:22,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:22,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:22,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:22,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:22,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:22,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:22,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:22,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:22,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:22,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:22,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:22,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:22,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:22,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:22,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:22,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:22,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:22,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:22,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:22,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:22,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:22,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:22,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:22,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:22,258 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:22,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:22,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:22,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:22,270 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:22,270 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:22,270 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:22,270 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:22,270 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:22,270 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:22,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:22,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:22,272 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:22,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:22,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:22,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:22,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:22,273 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:22,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:22,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:22,274 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:22,274 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:22,275 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_3198817e-c894-4fc8-a82c-45a461ca019e/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 -> 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d [2019-10-22 09:02:22,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:22,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:22,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:22,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:22,325 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:22,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-10-22 09:02:22,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/data/069c25965/a953211ffac748cfaa6a51b82ced088c/FLAGaf93cc89f [2019-10-22 09:02:22,762 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:22,766 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-10-22 09:02:22,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/data/069c25965/a953211ffac748cfaa6a51b82ced088c/FLAGaf93cc89f [2019-10-22 09:02:23,149 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/data/069c25965/a953211ffac748cfaa6a51b82ced088c [2019-10-22 09:02:23,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:23,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:23,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:23,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:23,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:23,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57231c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23, skipping insertion in model container [2019-10-22 09:02:23,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,166 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:23,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:23,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:23,452 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:23,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:23,502 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:23,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23 WrapperNode [2019-10-22 09:02:23,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:23,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:23,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:23,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:23,511 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:02:23" (1/1) ... [2019-10-22 09:02:23,518 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:02:23" (1/1) ... [2019-10-22 09:02:23,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:23,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:23,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:23,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:23,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... [2019-10-22 09:02:23,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:23,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:23,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:23,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:23,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/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:02:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:23,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:24,103 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2019-10-22 09:02:24,104 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2019-10-22 09:02:24,105 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:24,105 INFO L284 CfgBuilder]: Removed 70 assume(true) statements. [2019-10-22 09:02:24,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:24 BoogieIcfgContainer [2019-10-22 09:02:24,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:24,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:24,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:24,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:24,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:24,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:23" (1/3) ... [2019-10-22 09:02:24,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f693f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:24, skipping insertion in model container [2019-10-22 09:02:24,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:24,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:23" (2/3) ... [2019-10-22 09:02:24,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f693f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:24, skipping insertion in model container [2019-10-22 09:02:24,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:24,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:24" (3/3) ... [2019-10-22 09:02:24,113 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-10-22 09:02:24,148 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:24,149 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:24,149 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:24,149 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:24,149 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:24,149 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:24,149 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:24,150 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:24,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2019-10-22 09:02:24,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-10-22 09:02:24,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,192 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] [2019-10-22 09:02:24,192 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, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,192 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:24,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2019-10-22 09:02:24,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-10-22 09:02:24,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,202 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] [2019-10-22 09:02:24,202 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, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,206 INFO L791 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRYtrue ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 13#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 14#L541true havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 76#L248true assume !(1 == ~q_req_up~0); 72#L248-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 6#L263-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 42#L268-1true assume !(0 == ~q_read_ev~0); 46#L301-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 59#L306-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 51#L56true assume 1 == ~p_dw_pc~0; 131#L57true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 102#L77true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 53#L78true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 82#L377true assume !(0 != activate_threads_~tmp~1); 86#L377-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 115#L85true assume 1 == ~c_dr_pc~0; 58#L86true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 23#L106true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 117#L107true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 111#L385true assume !(0 != activate_threads_~tmp___0~1); 112#L385-2true assume !(1 == ~q_read_ev~0); 94#L319-1true assume !(1 == ~q_write_ev~0); 122#L481-1true [2019-10-22 09:02:24,206 INFO L793 eck$LassoCheckResult]: Loop: 122#L481-1true assume !false; 63#L482true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 24#L425true assume !true; 54#L441true start_simulation_~kernel_st~0 := 2; 70#L248-2true assume !(1 == ~q_req_up~0); 68#L248-3true start_simulation_~kernel_st~0 := 3; 43#L301-2true assume !(0 == ~q_read_ev~0); 22#L301-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 61#L306-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 40#L56-3true assume 1 == ~p_dw_pc~0; 130#L57-1true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 99#L77-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 50#L78-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 88#L377-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 67#L377-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 87#L85-3true assume 1 == ~c_dr_pc~0; 56#L86-1true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 12#L106-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 114#L107-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 95#L385-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 100#L385-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 101#L319-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 120#L324-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 77#L281-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 32#L293-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 107#L294-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 124#L500true assume !(0 == start_simulation_~tmp~4); 126#L500-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 74#L281-2true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 31#L293-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 118#L294-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 47#L455true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 108#L462true stop_simulation_#res := stop_simulation_~__retres2~0; 62#L463true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 35#L513true assume !(0 != start_simulation_~tmp___0~3); 122#L481-1true [2019-10-22 09:02:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -598217252, now seen corresponding path program 1 times [2019-10-22 09:02:24,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543983954] [2019-10-22 09:02:24,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,330 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:02:24,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543983954] [2019-10-22 09:02:24,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:24,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313799110] [2019-10-22 09:02:24,336 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash -556986804, now seen corresponding path program 1 times [2019-10-22 09:02:24,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305006455] [2019-10-22 09:02:24,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,349 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:02:24,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305006455] [2019-10-22 09:02:24,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800241340] [2019-10-22 09:02:24,351 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:24,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,367 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-10-22 09:02:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,406 INFO L93 Difference]: Finished difference Result 129 states and 196 transitions. [2019-10-22 09:02:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 196 transitions. [2019-10-22 09:02:24,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:02:24,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 123 states and 190 transitions. [2019-10-22 09:02:24,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-10-22 09:02:24,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-10-22 09:02:24,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 190 transitions. [2019-10-22 09:02:24,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:24,422 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2019-10-22 09:02:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 190 transitions. [2019-10-22 09:02:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-10-22 09:02:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-22 09:02:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2019-10-22 09:02:24,449 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2019-10-22 09:02:24,449 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2019-10-22 09:02:24,449 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:24,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 190 transitions. [2019-10-22 09:02:24,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:02:24,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,452 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] [2019-10-22 09:02:24,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,452 INFO L791 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 285#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 286#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 287#L248 assume !(1 == ~q_req_up~0); 322#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 273#L263-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 274#L268-1 assume !(0 == ~q_read_ev~0); 328#L301-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 334#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 342#L56 assume 1 == ~p_dw_pc~0; 343#L57 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 344#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 345#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 346#L377 assume !(0 != activate_threads_~tmp~1); 370#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 373#L85 assume 1 == ~c_dr_pc~0; 354#L86 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 283#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 304#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 386#L385 assume !(0 != activate_threads_~tmp___0~1); 387#L385-2 assume !(1 == ~q_read_ev~0); 377#L319-1 assume !(1 == ~q_write_ev~0); 321#L481-1 [2019-10-22 09:02:24,452 INFO L793 eck$LassoCheckResult]: Loop: 321#L481-1 assume !false; 357#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 305#L425 assume !false; 306#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 367#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 280#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 293#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 358#L405 assume !(0 != eval_~tmp___1~0); 347#L441 start_simulation_~kernel_st~0 := 2; 348#L248-2 assume !(1 == ~q_req_up~0); 319#L248-3 start_simulation_~kernel_st~0 := 3; 329#L301-2 assume !(0 == ~q_read_ev~0); 302#L301-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 303#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 325#L56-3 assume 1 == ~p_dw_pc~0; 326#L57-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 339#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 340#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 341#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 360#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 361#L85-3 assume 1 == ~c_dr_pc~0; 350#L86-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 276#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 284#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 378#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 379#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 381#L319-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 382#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 366#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 278#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 317#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 384#L500 assume !(0 == start_simulation_~tmp~4); 372#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 364#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 272#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 316#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 335#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 336#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 356#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 320#L513 assume !(0 != start_simulation_~tmp___0~3); 321#L481-1 [2019-10-22 09:02:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1395927454, now seen corresponding path program 1 times [2019-10-22 09:02:24,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82425281] [2019-10-22 09:02:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,480 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:02:24,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82425281] [2019-10-22 09:02:24,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:24,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138649015] [2019-10-22 09:02:24,481 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1442702753, now seen corresponding path program 1 times [2019-10-22 09:02:24,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50587817] [2019-10-22 09:02:24,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,524 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:02:24,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50587817] [2019-10-22 09:02:24,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:24,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737998057] [2019-10-22 09:02:24,525 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:24,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,526 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. cyclomatic complexity: 68 Second operand 3 states. [2019-10-22 09:02:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,537 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2019-10-22 09:02:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 189 transitions. [2019-10-22 09:02:24,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:02:24,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 189 transitions. [2019-10-22 09:02:24,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-10-22 09:02:24,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-10-22 09:02:24,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 189 transitions. [2019-10-22 09:02:24,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:24,542 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-10-22 09:02:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 189 transitions. [2019-10-22 09:02:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-10-22 09:02:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-22 09:02:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2019-10-22 09:02:24,547 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-10-22 09:02:24,547 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-10-22 09:02:24,547 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:24,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 189 transitions. [2019-10-22 09:02:24,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:02:24,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,550 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] [2019-10-22 09:02:24,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,550 INFO L791 eck$LassoCheckResult]: Stem: 635#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 540#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 541#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 542#L248 assume !(1 == ~q_req_up~0); 577#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 528#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 529#L268-1 assume !(0 == ~q_read_ev~0); 583#L301-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 589#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 597#L56 assume 1 == ~p_dw_pc~0; 598#L57 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 599#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 600#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 601#L377 assume !(0 != activate_threads_~tmp~1); 625#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 628#L85 assume 1 == ~c_dr_pc~0; 609#L86 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 538#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 559#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 641#L385 assume !(0 != activate_threads_~tmp___0~1); 642#L385-2 assume !(1 == ~q_read_ev~0); 632#L319-1 assume !(1 == ~q_write_ev~0); 576#L481-1 [2019-10-22 09:02:24,550 INFO L793 eck$LassoCheckResult]: Loop: 576#L481-1 assume !false; 612#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 560#L425 assume !false; 561#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 622#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 535#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 548#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 613#L405 assume !(0 != eval_~tmp___1~0); 602#L441 start_simulation_~kernel_st~0 := 2; 603#L248-2 assume !(1 == ~q_req_up~0); 574#L248-3 start_simulation_~kernel_st~0 := 3; 584#L301-2 assume !(0 == ~q_read_ev~0); 557#L301-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 558#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 580#L56-3 assume 1 == ~p_dw_pc~0; 581#L57-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 594#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 595#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 596#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 615#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 616#L85-3 assume 1 == ~c_dr_pc~0; 605#L86-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 531#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 539#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 633#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 634#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 636#L319-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 637#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 621#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 533#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 572#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 639#L500 assume !(0 == start_simulation_~tmp~4); 627#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 619#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 527#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 571#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 590#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 591#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 611#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 575#L513 assume !(0 != start_simulation_~tmp___0~3); 576#L481-1 [2019-10-22 09:02:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1310691940, now seen corresponding path program 1 times [2019-10-22 09:02:24,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657835140] [2019-10-22 09:02:24,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,576 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:02:24,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657835140] [2019-10-22 09:02:24,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:24,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737324123] [2019-10-22 09:02:24,578 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1442702753, now seen corresponding path program 2 times [2019-10-22 09:02:24,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620270929] [2019-10-22 09:02:24,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,629 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:02:24,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620270929] [2019-10-22 09:02:24,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:24,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90310675] [2019-10-22 09:02:24,630 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:24,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,631 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. cyclomatic complexity: 67 Second operand 3 states. [2019-10-22 09:02:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,704 INFO L93 Difference]: Finished difference Result 241 states and 364 transitions. [2019-10-22 09:02:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 364 transitions. [2019-10-22 09:02:24,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2019-10-22 09:02:24,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 364 transitions. [2019-10-22 09:02:24,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-10-22 09:02:24,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2019-10-22 09:02:24,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 364 transitions. [2019-10-22 09:02:24,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:24,711 INFO L688 BuchiCegarLoop]: Abstraction has 241 states and 364 transitions. [2019-10-22 09:02:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 364 transitions. [2019-10-22 09:02:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-10-22 09:02:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-22 09:02:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 364 transitions. [2019-10-22 09:02:24,722 INFO L711 BuchiCegarLoop]: Abstraction has 241 states and 364 transitions. [2019-10-22 09:02:24,723 INFO L591 BuchiCegarLoop]: Abstraction has 241 states and 364 transitions. [2019-10-22 09:02:24,723 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:24,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 364 transitions. [2019-10-22 09:02:24,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2019-10-22 09:02:24,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,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] [2019-10-22 09:02:24,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,726 INFO L791 eck$LassoCheckResult]: Stem: 1012#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 913#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 914#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 915#L248 assume !(1 == ~q_req_up~0); 952#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 901#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 902#L268-1 assume !(0 == ~q_read_ev~0); 958#L301-1 assume !(0 == ~q_write_ev~0); 964#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 972#L56 assume 1 == ~p_dw_pc~0; 973#L57 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 974#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 975#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 976#L377 assume !(0 != activate_threads_~tmp~1); 999#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1004#L85 assume 1 == ~c_dr_pc~0; 984#L86 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 911#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 933#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1020#L385 assume !(0 != activate_threads_~tmp___0~1); 1021#L385-2 assume !(1 == ~q_read_ev~0); 1008#L319-1 assume !(1 == ~q_write_ev~0); 1009#L481-1 [2019-10-22 09:02:24,726 INFO L793 eck$LassoCheckResult]: Loop: 1009#L481-1 assume !false; 1070#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1069#L425 assume !false; 1068#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 998#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 908#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 922#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 988#L405 assume !(0 != eval_~tmp___1~0); 977#L441 start_simulation_~kernel_st~0 := 2; 978#L248-2 assume !(1 == ~q_req_up~0); 949#L248-3 start_simulation_~kernel_st~0 := 3; 959#L301-2 assume !(0 == ~q_read_ev~0); 931#L301-4 assume !(0 == ~q_write_ev~0); 932#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 955#L56-3 assume 1 == ~p_dw_pc~0; 956#L57-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 969#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 970#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 971#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 991#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 992#L85-3 assume 1 == ~c_dr_pc~0; 980#L86-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 904#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 912#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1010#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1011#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1015#L319-3 assume !(1 == ~q_write_ev~0); 1016#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1102#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1100#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1099#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1097#L500 assume !(0 == start_simulation_~tmp~4); 1095#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1094#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1092#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1091#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1090#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1089#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 1088#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1087#L513 assume !(0 != start_simulation_~tmp___0~3); 1009#L481-1 [2019-10-22 09:02:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1704411678, now seen corresponding path program 1 times [2019-10-22 09:02:24,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054879576] [2019-10-22 09:02:24,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,761 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:02:24,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054879576] [2019-10-22 09:02:24,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:24,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435212749] [2019-10-22 09:02:24,762 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1331674203, now seen corresponding path program 1 times [2019-10-22 09:02:24,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562977360] [2019-10-22 09:02:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,791 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:02:24,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562977360] [2019-10-22 09:02:24,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:24,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685825613] [2019-10-22 09:02:24,793 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:24,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,793 INFO L87 Difference]: Start difference. First operand 241 states and 364 transitions. cyclomatic complexity: 124 Second operand 3 states. [2019-10-22 09:02:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,854 INFO L93 Difference]: Finished difference Result 409 states and 596 transitions. [2019-10-22 09:02:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 596 transitions. [2019-10-22 09:02:24,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 350 [2019-10-22 09:02:24,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 596 transitions. [2019-10-22 09:02:24,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2019-10-22 09:02:24,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2019-10-22 09:02:24,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 596 transitions. [2019-10-22 09:02:24,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:24,863 INFO L688 BuchiCegarLoop]: Abstraction has 409 states and 596 transitions. [2019-10-22 09:02:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 596 transitions. [2019-10-22 09:02:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2019-10-22 09:02:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-10-22 09:02:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 592 transitions. [2019-10-22 09:02:24,878 INFO L711 BuchiCegarLoop]: Abstraction has 405 states and 592 transitions. [2019-10-22 09:02:24,879 INFO L591 BuchiCegarLoop]: Abstraction has 405 states and 592 transitions. [2019-10-22 09:02:24,879 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:24,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 405 states and 592 transitions. [2019-10-22 09:02:24,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 346 [2019-10-22 09:02:24,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,882 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] [2019-10-22 09:02:24,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,883 INFO L791 eck$LassoCheckResult]: Stem: 1684#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 1572#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1573#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 1574#L248 assume !(1 == ~q_req_up~0); 1660#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1661#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1614#L268-1 assume !(0 == ~q_read_ev~0); 1615#L301-1 assume !(0 == ~q_write_ev~0); 1647#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1634#L56 assume !(1 == ~p_dw_pc~0); 1635#L56-2 assume !(2 == ~p_dw_pc~0); 1722#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 1721#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1720#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1719#L377 assume !(0 != activate_threads_~tmp~1); 1718#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1695#L85 assume 1 == ~c_dr_pc~0; 1645#L86 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 1570#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1693#L385 assume !(0 != activate_threads_~tmp___0~1); 1694#L385-2 assume !(1 == ~q_read_ev~0); 1681#L319-1 assume !(1 == ~q_write_ev~0); 1607#L481-1 [2019-10-22 09:02:24,883 INFO L793 eck$LassoCheckResult]: Loop: 1607#L481-1 assume !false; 1700#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1589#L425 assume !false; 1590#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1665#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1567#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1580#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1652#L405 assume !(0 != eval_~tmp___1~0); 1638#L441 start_simulation_~kernel_st~0 := 2; 1639#L248-2 assume !(1 == ~q_req_up~0); 1605#L248-3 start_simulation_~kernel_st~0 := 3; 1616#L301-2 assume !(0 == ~q_read_ev~0); 1617#L301-4 assume !(0 == ~q_write_ev~0); 1893#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1892#L56-3 assume !(1 == ~p_dw_pc~0); 1891#L56-5 assume !(2 == ~p_dw_pc~0); 1679#L66-3 is_do_write_p_triggered_~__retres1~0 := 0; 1680#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1632#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1633#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1655#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1656#L85-3 assume 1 == ~c_dr_pc~0; 1641#L86-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 1563#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1571#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1682#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1683#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1686#L319-3 assume !(1 == ~q_write_ev~0); 1687#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1937#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1934#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1932#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1931#L500 assume !(0 == start_simulation_~tmp~4); 1929#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1928#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1926#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1925#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1924#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1923#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 1648#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1606#L513 assume !(0 != start_simulation_~tmp___0~3); 1607#L481-1 [2019-10-22 09:02:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1443448613, now seen corresponding path program 1 times [2019-10-22 09:02:24,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091817088] [2019-10-22 09:02:24,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,906 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:02:24,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091817088] [2019-10-22 09:02:24,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:24,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208867341] [2019-10-22 09:02:24,907 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash -399518190, now seen corresponding path program 1 times [2019-10-22 09:02:24,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717843073] [2019-10-22 09:02:24,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,933 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:02:24,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717843073] [2019-10-22 09:02:24,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:24,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455451377] [2019-10-22 09:02:24,934 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:24,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,935 INFO L87 Difference]: Start difference. First operand 405 states and 592 transitions. cyclomatic complexity: 189 Second operand 3 states. [2019-10-22 09:02:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,974 INFO L93 Difference]: Finished difference Result 721 states and 1035 transitions. [2019-10-22 09:02:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1035 transitions. [2019-10-22 09:02:24,979 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 652 [2019-10-22 09:02:24,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1035 transitions. [2019-10-22 09:02:24,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2019-10-22 09:02:24,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2019-10-22 09:02:24,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1035 transitions. [2019-10-22 09:02:24,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:24,985 INFO L688 BuchiCegarLoop]: Abstraction has 721 states and 1035 transitions. [2019-10-22 09:02:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1035 transitions. [2019-10-22 09:02:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 713. [2019-10-22 09:02:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-22 09:02:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1027 transitions. [2019-10-22 09:02:25,024 INFO L711 BuchiCegarLoop]: Abstraction has 713 states and 1027 transitions. [2019-10-22 09:02:25,024 INFO L591 BuchiCegarLoop]: Abstraction has 713 states and 1027 transitions. [2019-10-22 09:02:25,024 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:25,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 713 states and 1027 transitions. [2019-10-22 09:02:25,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 644 [2019-10-22 09:02:25,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,035 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:02:25,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,036 INFO L791 eck$LassoCheckResult]: Stem: 2821#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 2707#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2708#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 2709#L248 assume !(1 == ~q_req_up~0); 2746#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2695#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2696#L268-1 assume !(0 == ~q_read_ev~0); 2763#L301-1 assume !(0 == ~q_write_ev~0); 2764#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2770#L56 assume !(1 == ~p_dw_pc~0); 2771#L56-2 assume !(2 == ~p_dw_pc~0); 2822#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 2823#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3080#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3078#L377 assume !(0 != activate_threads_~tmp~1); 2811#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2812#L85 assume !(1 == ~c_dr_pc~0); 2814#L85-2 assume !(2 == ~c_dr_pc~0); 2704#L95-1 is_do_read_c_triggered_~__retres1~1 := 0; 2705#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2726#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2835#L385 assume !(0 != activate_threads_~tmp___0~1); 2836#L385-2 assume !(1 == ~q_read_ev~0); 2819#L319-1 assume !(1 == ~q_write_ev~0); 2820#L481-1 [2019-10-22 09:02:25,036 INFO L793 eck$LassoCheckResult]: Loop: 2820#L481-1 assume !false; 3048#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3047#L425 assume !false; 3042#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3040#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3037#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3035#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3032#L405 assume !(0 != eval_~tmp___1~0); 3033#L441 start_simulation_~kernel_st~0 := 2; 3124#L248-2 assume !(1 == ~q_req_up~0); 3119#L248-3 start_simulation_~kernel_st~0 := 3; 3117#L301-2 assume !(0 == ~q_read_ev~0); 3115#L301-4 assume !(0 == ~q_write_ev~0); 3113#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3111#L56-3 assume !(1 == ~p_dw_pc~0); 3109#L56-5 assume !(2 == ~p_dw_pc~0); 3107#L66-3 is_do_write_p_triggered_~__retres1~0 := 0; 3105#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3103#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3101#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3099#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3097#L85-3 assume !(1 == ~c_dr_pc~0); 3095#L85-5 assume !(2 == ~c_dr_pc~0); 3093#L95-3 is_do_read_c_triggered_~__retres1~1 := 0; 3091#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3089#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3087#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 3085#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3083#L319-3 assume !(1 == ~q_write_ev~0); 3079#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3077#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3075#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3074#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3072#L500 assume !(0 == start_simulation_~tmp~4); 3069#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3067#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3064#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3062#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3060#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3058#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 3056#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3055#L513 assume !(0 != start_simulation_~tmp___0~3); 2820#L481-1 [2019-10-22 09:02:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 1 times [2019-10-22 09:02:25,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705343409] [2019-10-22 09:02:25,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,082 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 623522987, now seen corresponding path program 1 times [2019-10-22 09:02:25,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717353413] [2019-10-22 09:02:25,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,116 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:02:25,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717353413] [2019-10-22 09:02:25,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:25,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399389721] [2019-10-22 09:02:25,117 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:25,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:25,118 INFO L87 Difference]: Start difference. First operand 713 states and 1027 transitions. cyclomatic complexity: 318 Second operand 5 states. [2019-10-22 09:02:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,226 INFO L93 Difference]: Finished difference Result 1177 states and 1657 transitions. [2019-10-22 09:02:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:25,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 1657 transitions. [2019-10-22 09:02:25,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1088 [2019-10-22 09:02:25,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 1177 states and 1657 transitions. [2019-10-22 09:02:25,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1177 [2019-10-22 09:02:25,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1177 [2019-10-22 09:02:25,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1177 states and 1657 transitions. [2019-10-22 09:02:25,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:25,244 INFO L688 BuchiCegarLoop]: Abstraction has 1177 states and 1657 transitions. [2019-10-22 09:02:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states and 1657 transitions. [2019-10-22 09:02:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 737. [2019-10-22 09:02:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-22 09:02:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1051 transitions. [2019-10-22 09:02:25,262 INFO L711 BuchiCegarLoop]: Abstraction has 737 states and 1051 transitions. [2019-10-22 09:02:25,262 INFO L591 BuchiCegarLoop]: Abstraction has 737 states and 1051 transitions. [2019-10-22 09:02:25,262 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:25,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 737 states and 1051 transitions. [2019-10-22 09:02:25,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 668 [2019-10-22 09:02:25,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,270 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:02:25,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,270 INFO L791 eck$LassoCheckResult]: Stem: 4742#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 4615#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4616#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 4617#L248 assume !(1 == ~q_req_up~0); 4657#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4601#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4602#L268-1 assume !(0 == ~q_read_ev~0); 4676#L301-1 assume !(0 == ~q_write_ev~0); 4677#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4683#L56 assume !(1 == ~p_dw_pc~0); 4684#L56-2 assume !(2 == ~p_dw_pc~0); 4743#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 4744#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4685#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4686#L377 assume !(0 != activate_threads_~tmp~1); 4727#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4728#L85 assume !(1 == ~c_dr_pc~0); 4732#L85-2 assume !(2 == ~c_dr_pc~0); 4733#L95-1 is_do_read_c_triggered_~__retres1~1 := 0; 4633#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4634#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4758#L385 assume !(0 != activate_threads_~tmp___0~1); 4759#L385-2 assume !(1 == ~q_read_ev~0); 4741#L319-1 assume !(1 == ~q_write_ev~0); 4655#L481-1 [2019-10-22 09:02:25,273 INFO L793 eck$LassoCheckResult]: Loop: 4655#L481-1 assume !false; 4699#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4700#L425 assume !false; 4913#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4911#L281 assume !(0 == ~p_dw_st~0); 4908#L285 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 4905#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4903#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4898#L405 assume !(0 != eval_~tmp___1~0); 4896#L441 start_simulation_~kernel_st~0 := 2; 4891#L248-2 assume !(1 == ~q_req_up~0); 4886#L248-3 start_simulation_~kernel_st~0 := 3; 4884#L301-2 assume !(0 == ~q_read_ev~0); 4882#L301-4 assume !(0 == ~q_write_ev~0); 4876#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4877#L56-3 assume !(1 == ~p_dw_pc~0); 4863#L56-5 assume !(2 == ~p_dw_pc~0); 4864#L66-3 is_do_write_p_triggered_~__retres1~0 := 0; 4745#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4746#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4731#L377-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 4705#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4706#L85-3 assume !(1 == ~c_dr_pc~0); 4723#L85-5 assume !(2 == ~c_dr_pc~0); 4724#L95-3 is_do_read_c_triggered_~__retres1~1 := 0; 4613#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4614#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4739#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 4740#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 4749#L319-3 assume !(1 == ~q_write_ev~0); 4750#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4770#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4649#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4650#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4755#L500 assume !(0 == start_simulation_~tmp~4); 4726#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4710#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4600#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5312#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5311#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 5310#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 5309#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 4654#L513 assume !(0 != start_simulation_~tmp___0~3); 4655#L481-1 [2019-10-22 09:02:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 2 times [2019-10-22 09:02:25,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528490239] [2019-10-22 09:02:25,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,303 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1913620986, now seen corresponding path program 1 times [2019-10-22 09:02:25,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602338852] [2019-10-22 09:02:25,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,370 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:02:25,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602338852] [2019-10-22 09:02:25,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:25,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658976248] [2019-10-22 09:02:25,371 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:25,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:25,372 INFO L87 Difference]: Start difference. First operand 737 states and 1051 transitions. cyclomatic complexity: 318 Second operand 5 states. [2019-10-22 09:02:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,459 INFO L93 Difference]: Finished difference Result 1353 states and 1921 transitions. [2019-10-22 09:02:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:25,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1353 states and 1921 transitions. [2019-10-22 09:02:25,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1276 [2019-10-22 09:02:25,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1353 states to 1353 states and 1921 transitions. [2019-10-22 09:02:25,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1353 [2019-10-22 09:02:25,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1353 [2019-10-22 09:02:25,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1353 states and 1921 transitions. [2019-10-22 09:02:25,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:25,479 INFO L688 BuchiCegarLoop]: Abstraction has 1353 states and 1921 transitions. [2019-10-22 09:02:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states and 1921 transitions. [2019-10-22 09:02:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 761. [2019-10-22 09:02:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-22 09:02:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1065 transitions. [2019-10-22 09:02:25,498 INFO L711 BuchiCegarLoop]: Abstraction has 761 states and 1065 transitions. [2019-10-22 09:02:25,498 INFO L591 BuchiCegarLoop]: Abstraction has 761 states and 1065 transitions. [2019-10-22 09:02:25,498 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:25,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 761 states and 1065 transitions. [2019-10-22 09:02:25,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 692 [2019-10-22 09:02:25,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,503 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:02:25,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,503 INFO L791 eck$LassoCheckResult]: Stem: 6841#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 6718#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6719#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 6720#L248 assume !(1 == ~q_req_up~0); 6758#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6704#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6705#L268-1 assume !(0 == ~q_read_ev~0); 6778#L301-1 assume !(0 == ~q_write_ev~0); 6779#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6785#L56 assume !(1 == ~p_dw_pc~0); 6786#L56-2 assume !(2 == ~p_dw_pc~0); 7116#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 7114#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 7111#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7109#L377 assume !(0 != activate_threads_~tmp~1); 7107#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7105#L85 assume !(1 == ~c_dr_pc~0); 7103#L85-2 assume !(2 == ~c_dr_pc~0); 7102#L95-1 is_do_read_c_triggered_~__retres1~1 := 0; 7101#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7100#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6853#L385 assume !(0 != activate_threads_~tmp___0~1); 6854#L385-2 assume !(1 == ~q_read_ev~0); 6837#L319-1 assume !(1 == ~q_write_ev~0); 6838#L481-1 [2019-10-22 09:02:25,503 INFO L793 eck$LassoCheckResult]: Loop: 6838#L481-1 assume !false; 7073#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 7071#L425 assume !false; 7069#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7065#L281 assume !(0 == ~p_dw_st~0); 7061#L285 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 7056#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7052#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 7047#L405 assume !(0 != eval_~tmp___1~0); 7042#L441 start_simulation_~kernel_st~0 := 2; 7012#L248-2 assume !(1 == ~q_req_up~0); 7009#L248-3 start_simulation_~kernel_st~0 := 3; 7008#L301-2 assume !(0 == ~q_read_ev~0); 7006#L301-4 assume !(0 == ~q_write_ev~0); 7004#L306-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7002#L56-3 assume !(1 == ~p_dw_pc~0); 6730#L56-5 assume !(2 == ~p_dw_pc~0); 6731#L66-3 is_do_write_p_triggered_~__retres1~0 := 0; 7161#L77-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 7156#L78-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7151#L377-3 assume !(0 != activate_threads_~tmp~1); 7135#L377-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7129#L85-3 assume !(1 == ~c_dr_pc~0); 7123#L85-5 assume !(2 == ~c_dr_pc~0); 7095#L95-3 is_do_read_c_triggered_~__retres1~1 := 0; 6921#L106-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6922#L107-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6915#L385-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 6916#L385-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 6909#L319-3 assume !(1 == ~q_write_ev~0); 6907#L324-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7145#L281-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7142#L293-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7132#L294-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 7126#L500 assume !(0 == start_simulation_~tmp~4); 7122#L500-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7094#L281-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7092#L293-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7091#L294-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 7090#L455 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 7089#L462 stop_simulation_#res := stop_simulation_~__retres2~0; 7087#L463 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 7085#L513 assume !(0 != start_simulation_~tmp___0~3); 6838#L481-1 [2019-10-22 09:02:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 3 times [2019-10-22 09:02:25,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103288728] [2019-10-22 09:02:25,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash 108182652, now seen corresponding path program 1 times [2019-10-22 09:02:25,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375780261] [2019-10-22 09:02:25,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,552 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:02:25,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375780261] [2019-10-22 09:02:25,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:25,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900336295] [2019-10-22 09:02:25,554 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:25,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,554 INFO L87 Difference]: Start difference. First operand 761 states and 1065 transitions. cyclomatic complexity: 308 Second operand 3 states. [2019-10-22 09:02:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,591 INFO L93 Difference]: Finished difference Result 1069 states and 1461 transitions. [2019-10-22 09:02:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1069 states and 1461 transitions. [2019-10-22 09:02:25,598 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 988 [2019-10-22 09:02:25,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1069 states to 1069 states and 1461 transitions. [2019-10-22 09:02:25,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1069 [2019-10-22 09:02:25,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1069 [2019-10-22 09:02:25,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1069 states and 1461 transitions. [2019-10-22 09:02:25,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:25,607 INFO L688 BuchiCegarLoop]: Abstraction has 1069 states and 1461 transitions. [2019-10-22 09:02:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states and 1461 transitions. [2019-10-22 09:02:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2019-10-22 09:02:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-22 09:02:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1461 transitions. [2019-10-22 09:02:25,629 INFO L711 BuchiCegarLoop]: Abstraction has 1069 states and 1461 transitions. [2019-10-22 09:02:25,629 INFO L591 BuchiCegarLoop]: Abstraction has 1069 states and 1461 transitions. [2019-10-22 09:02:25,629 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:25,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1069 states and 1461 transitions. [2019-10-22 09:02:25,635 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 988 [2019-10-22 09:02:25,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,635 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:02:25,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,636 INFO L791 eck$LassoCheckResult]: Stem: 8668#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 8553#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 8554#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 8555#L248 assume !(1 == ~q_req_up~0); 8591#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 8540#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 8541#L268-1 assume !(0 == ~q_read_ev~0); 8609#L301-1 assume !(0 == ~q_write_ev~0); 8610#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8879#L56 assume !(1 == ~p_dw_pc~0); 8878#L56-2 assume !(2 == ~p_dw_pc~0); 8877#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 8876#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8875#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 8874#L377 assume !(0 != activate_threads_~tmp~1); 8873#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 8872#L85 assume !(1 == ~c_dr_pc~0); 8657#L85-2 assume !(2 == ~c_dr_pc~0); 8658#L95-1 is_do_read_c_triggered_~__retres1~1 := 0; 8571#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 8572#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8682#L385 assume !(0 != activate_threads_~tmp___0~1); 8683#L385-2 assume !(1 == ~q_read_ev~0); 8664#L319-1 assume !(1 == ~q_write_ev~0); 8665#L481-1 assume !false; 9106#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 8841#L425 [2019-10-22 09:02:25,636 INFO L793 eck$LassoCheckResult]: Loop: 8841#L425 assume !false; 8811#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8809#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 8803#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8779#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 8773#L405 assume 0 != eval_~tmp___1~0; 8720#L405-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 8573#L414 assume !(0 != eval_~tmp~2); 8575#L410 assume !(0 == ~c_dr_st~0); 8841#L425 [2019-10-22 09:02:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 1 times [2019-10-22 09:02:25,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859359116] [2019-10-22 09:02:25,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,658 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1127629253, now seen corresponding path program 1 times [2019-10-22 09:02:25,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249252034] [2019-10-22 09:02:25,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,672 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash -644372710, now seen corresponding path program 1 times [2019-10-22 09:02:25,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789417777] [2019-10-22 09:02:25,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,699 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:02:25,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789417777] [2019-10-22 09:02:25,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089924462] [2019-10-22 09:02:25,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,760 INFO L87 Difference]: Start difference. First operand 1069 states and 1461 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-10-22 09:02:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,806 INFO L93 Difference]: Finished difference Result 1003 states and 1362 transitions. [2019-10-22 09:02:25,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1003 states and 1362 transitions. [2019-10-22 09:02:25,814 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 916 [2019-10-22 09:02:25,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1003 states to 1003 states and 1362 transitions. [2019-10-22 09:02:25,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1003 [2019-10-22 09:02:25,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1003 [2019-10-22 09:02:25,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1003 states and 1362 transitions. [2019-10-22 09:02:25,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:25,824 INFO L688 BuchiCegarLoop]: Abstraction has 1003 states and 1362 transitions. [2019-10-22 09:02:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states and 1362 transitions. [2019-10-22 09:02:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2019-10-22 09:02:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-10-22 09:02:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1362 transitions. [2019-10-22 09:02:25,847 INFO L711 BuchiCegarLoop]: Abstraction has 1003 states and 1362 transitions. [2019-10-22 09:02:25,847 INFO L591 BuchiCegarLoop]: Abstraction has 1003 states and 1362 transitions. [2019-10-22 09:02:25,847 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:02:25,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1362 transitions. [2019-10-22 09:02:25,856 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 916 [2019-10-22 09:02:25,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,856 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:02:25,857 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,857 INFO L791 eck$LassoCheckResult]: Stem: 10748#ULTIMATE.startENTRY ~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0; 10632#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 10633#L541 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 10634#L248 assume !(1 == ~q_req_up~0); 10672#L248-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 10620#L263-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 10621#L268-1 assume !(0 == ~q_read_ev~0); 10689#L301-1 assume !(0 == ~q_write_ev~0); 10690#L306-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10696#L56 assume !(1 == ~p_dw_pc~0); 10682#L56-2 assume !(2 == ~p_dw_pc~0); 10683#L66-1 is_do_write_p_triggered_~__retres1~0 := 0; 10749#L77 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10697#L78 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10698#L377 assume !(0 != activate_threads_~tmp~1); 10732#L377-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10735#L85 assume !(1 == ~c_dr_pc~0); 10738#L85-2 assume !(2 == ~c_dr_pc~0); 10629#L95-1 is_do_read_c_triggered_~__retres1~1 := 0; 10630#L106 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10949#L107 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10761#L385 assume !(0 != activate_threads_~tmp___0~1); 10762#L385-2 assume !(1 == ~q_read_ev~0); 10743#L319-1 assume !(1 == ~q_write_ev~0); 10744#L481-1 assume !false; 10709#L482 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10710#L425 [2019-10-22 09:02:25,857 INFO L793 eck$LassoCheckResult]: Loop: 10710#L425 assume !false; 11529#L401 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11527#L281 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 11526#L293 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11525#L294 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 11523#L405 assume 0 != eval_~tmp___1~0; 11521#L405-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10654#L414 assume !(0 != eval_~tmp~2); 10656#L410 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 11532#L429 assume !(0 != eval_~tmp___0~2); 10710#L425 [2019-10-22 09:02:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 2 times [2019-10-22 09:02:25,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113686849] [2019-10-22 09:02:25,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 596766931, now seen corresponding path program 1 times [2019-10-22 09:02:25,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157416689] [2019-10-22 09:02:25,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1499280926, now seen corresponding path program 1 times [2019-10-22 09:02:25,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839706550] [2019-10-22 09:02:25,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:26,300 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-10-22 09:02:26,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:26 BoogieIcfgContainer [2019-10-22 09:02:26,402 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:26,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:26,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:26,403 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:26,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:24" (3/4) ... [2019-10-22 09:02:26,406 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:02:26,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3198817e-c894-4fc8-a82c-45a461ca019e/bin/uautomizer/witness.graphml [2019-10-22 09:02:26,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:26,474 INFO L168 Benchmark]: Toolchain (without parser) took 3321.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,474 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:26,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:26,478 INFO L168 Benchmark]: Boogie Preprocessor took 26.34 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,478 INFO L168 Benchmark]: RCFGBuilder took 532.77 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,479 INFO L168 Benchmark]: BuchiAutomizer took 2295.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.5 MB). Peak memory consumption was 294.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,479 INFO L168 Benchmark]: Witness Printer took 69.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,481 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.34 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 532.77 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2295.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.5 MB). Peak memory consumption was 294.4 MB. Max. memory is 11.5 GB. * Witness Printer took 69.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1003 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1069 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1617 SDtfs, 1741 SDslu, 1853 SDs, 0 SdLazy, 174 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 400]: 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_last_write=0, c_dr_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c487b8c=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2899a6a4=0, \result=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d987fa1=0, c_dr_st=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48dc3c08=0, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=0, tmp___0=0, q_write_ev=2, __retres1=1, t=0, p_dw_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a7f086b=0, q_free=1, fast_clk_edge=2, __retres1=0, p_dw_st=0, \result=0, tmp___0=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7026e887=0, slow_clk_edge=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41c774c=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=0, q_buf_0=0, __retres1=0, tmp=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 400]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int fast_clk_edge ; [L15] int slow_clk_edge ; [L16] int q_buf_0 ; [L17] int q_free ; [L18] int q_read_ev ; [L19] int q_write_ev ; [L20] int q_req_up ; [L21] int q_ev ; [L42] int p_num_write ; [L43] int p_last_write ; [L44] int p_dw_st ; [L45] int p_dw_pc ; [L46] int p_dw_i ; [L47] int c_num_read ; [L48] int c_last_read ; [L49] int c_dr_st ; [L50] int c_dr_pc ; [L51] int c_dr_i ; [L184] static int a_t ; [L334] static int t = 0; [L545] int __retres1 ; [L529] fast_clk_edge = 2 [L530] slow_clk_edge = 2 [L531] q_free = 1 [L532] q_write_ev = 2 [L533] q_read_ev = q_write_ev [L534] p_num_write = 0 [L535] p_dw_pc = 0 [L536] p_dw_i = 1 [L537] c_num_read = 0 [L538] c_dr_pc = 0 [L539] c_dr_i = 1 [L467] int kernel_st ; [L468] int tmp ; [L469] int tmp___0 ; [L473] kernel_st = 0 [L248] COND FALSE !((int )q_req_up == 1) [L263] COND TRUE (int )p_dw_i == 1 [L264] p_dw_st = 0 [L268] COND TRUE (int )c_dr_i == 1 [L269] c_dr_st = 0 [L301] COND FALSE !((int )q_read_ev == 0) [L306] COND FALSE !((int )q_write_ev == 0) [L370] int tmp ; [L371] int tmp___0 ; [L53] int __retres1 ; [L56] COND FALSE !((int )p_dw_pc == 1) [L66] COND FALSE !((int )p_dw_pc == 2) [L76] __retres1 = 0 [L78] return (__retres1); [L375] tmp = is_do_write_p_triggered() [L377] COND FALSE !(\read(tmp)) [L82] int __retres1 ; [L85] COND FALSE !((int )c_dr_pc == 1) [L95] COND FALSE !((int )c_dr_pc == 2) [L105] __retres1 = 0 [L107] return (__retres1); [L383] tmp___0 = is_do_read_c_triggered() [L385] COND FALSE !(\read(tmp___0)) [L319] COND FALSE !((int )q_read_ev == 1) [L324] COND FALSE !((int )q_write_ev == 1) [L481] COND TRUE 1 [L484] kernel_st = 1 [L395] int tmp ; [L396] int tmp___0 ; [L397] int tmp___1 ; Loop: [L400] COND TRUE 1 [L278] int __retres1 ; [L281] COND TRUE (int )p_dw_st == 0 [L282] __retres1 = 1 [L294] return (__retres1); [L403] tmp___1 = exists_runnable_thread() [L405] COND TRUE \read(tmp___1) [L410] COND TRUE (int )p_dw_st == 0 [L412] tmp = __VERIFIER_nondet_int() [L414] COND FALSE !(\read(tmp)) [L425] COND TRUE (int )c_dr_st == 0 [L427] tmp___0 = __VERIFIER_nondet_int() [L429] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...