./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ce92743863c5d30c478a48a973506d73113681a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 08:02:23,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:02:23,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:02:23,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:02:23,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:02:23,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:02:23,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:02:23,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:02:23,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:02:23,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:02:23,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:02:23,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:02:23,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:02:23,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:02:23,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:02:23,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:02:23,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:02:23,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:02:23,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:02:23,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:02:23,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:02:23,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:02:23,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:02:23,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:02:23,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:02:23,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:02:23,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:02:23,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:02:23,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:02:23,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:02:23,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:02:23,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:02:23,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:02:23,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:02:23,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:02:23,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:02:23,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:02:23,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:02:23,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:02:23,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:02:23,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:02:23,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:02:23,601 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:02:23,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:02:23,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:02:23,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:02:23,603 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:02:23,603 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:02:23,604 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:02:23,604 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:02:23,604 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:02:23,604 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:02:23,605 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:02:23,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:02:23,605 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:02:23,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:02:23,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:02:23,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:02:23,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:02:23,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:02:23,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:02:23,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:02:23,607 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:02:23,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:02:23,608 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:02:23,608 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:02:23,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:02:23,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:02:23,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:02:23,609 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:02:23,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:02:23,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:02:23,610 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:02:23,610 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:02:23,611 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:02:23,611 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ce92743863c5d30c478a48a973506d73113681a [2020-10-20 08:02:23,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:02:23,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:02:23,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:02:23,824 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:02:23,824 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:02:23,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2020-10-20 08:02:23,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d090734dc/c3b9766c79cd4685ba63fe4985c1cc4f/FLAGc68b48f27 [2020-10-20 08:02:24,369 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:02:24,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2020-10-20 08:02:24,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d090734dc/c3b9766c79cd4685ba63fe4985c1cc4f/FLAGc68b48f27 [2020-10-20 08:02:24,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d090734dc/c3b9766c79cd4685ba63fe4985c1cc4f [2020-10-20 08:02:24,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:02:24,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:02:24,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:24,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:02:24,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:02:24,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:24" (1/1) ... [2020-10-20 08:02:24,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba19271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:24, skipping insertion in model container [2020-10-20 08:02:24,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:24" (1/1) ... [2020-10-20 08:02:24,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:02:24,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:02:25,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:25,085 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:02:25,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:25,151 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:02:25,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25 WrapperNode [2020-10-20 08:02:25,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:25,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:25,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:02:25,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:02:25,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:25,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:02:25,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:02:25,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:02:25,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... [2020-10-20 08:02:25,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:02:25,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:02:25,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:02:25,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:02:25,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:02:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:02:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:02:25,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:02:25,933 INFO L751 $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; [2020-10-20 08:02:25,933 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2020-10-20 08:02:25,951 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:02:25,951 INFO L298 CfgBuilder]: Removed 74 assume(true) statements. [2020-10-20 08:02:25,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:25 BoogieIcfgContainer [2020-10-20 08:02:25,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:02:25,958 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:02:25,958 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:02:25,964 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:02:25,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:25,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:02:24" (1/3) ... [2020-10-20 08:02:25,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b66c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:25, skipping insertion in model container [2020-10-20 08:02:25,968 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:25,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:25" (2/3) ... [2020-10-20 08:02:25,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b66c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:25, skipping insertion in model container [2020-10-20 08:02:25,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:25,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:25" (3/3) ... [2020-10-20 08:02:25,974 INFO L373 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2020-10-20 08:02:26,041 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:02:26,042 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:02:26,042 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:02:26,043 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:02:26,043 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:02:26,043 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:02:26,043 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:02:26,043 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:02:26,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states. [2020-10-20 08:02:26,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2020-10-20 08:02:26,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:26,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:26,147 INFO L852 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] [2020-10-20 08:02:26,147 INFO L853 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] [2020-10-20 08:02:26,147 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:02:26,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states. [2020-10-20 08:02:26,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2020-10-20 08:02:26,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:26,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:26,156 INFO L852 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] [2020-10-20 08:02:26,156 INFO L853 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] [2020-10-20 08:02:26,161 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 11#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; 49#L543true havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 98#L250true assume !(1 == ~q_req_up~0); 108#L250-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 36#L265-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 76#L270-1true assume !(0 == ~q_read_ev~0); 82#L303-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 88#L308-1true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 61#L58true assume 1 == ~p_dw_pc~0; 24#L59true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 110#L79true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 63#L80true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 130#L379true assume !(0 != activate_threads_~tmp~1); 113#L379-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 17#L87true assume 1 == ~c_dr_pc~0; 95#L88true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 55#L108true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 19#L109true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3#L387true assume !(0 != activate_threads_~tmp___0~1); 6#L387-2true assume !(1 == ~q_read_ev~0); 9#L321-1true assume !(1 == ~q_write_ev~0); 25#L483-1true [2020-10-20 08:02:26,163 INFO L796 eck$LassoCheckResult]: Loop: 25#L483-1true assume !false; 97#L484true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 66#L427true assume !true; 96#L443true start_simulation_~kernel_st~0 := 2; 106#L250-2true assume !(1 == ~q_req_up~0); 105#L250-3true start_simulation_~kernel_st~0 := 3; 77#L303-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 71#L303-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 93#L308-3true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 73#L58-3true assume 1 == ~p_dw_pc~0; 22#L59-1true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 133#L79-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 60#L80-1true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 115#L379-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 119#L379-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 121#L87-3true assume 1 == ~c_dr_pc~0; 92#L88-1true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 54#L108-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 16#L109-1true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10#L387-3true assume !(0 != activate_threads_~tmp___0~1); 123#L387-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 124#L321-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 23#L326-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 99#L283-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 45#L295-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5#L296-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 34#L502true assume !(0 == start_simulation_~tmp~4); 39#L502-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 109#L283-2true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 44#L295-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4#L296-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 69#L457true assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 20#L464true stop_simulation_#res := stop_simulation_~__retres2~0; 94#L465true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 64#L515true assume !(0 != start_simulation_~tmp___0~3); 25#L483-1true [2020-10-20 08:02:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -598217252, now seen corresponding path program 1 times [2020-10-20 08:02:26,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649022970] [2020-10-20 08:02:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649022970] [2020-10-20 08:02:26,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:26,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400410147] [2020-10-20 08:02:26,375 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash -250486326, now seen corresponding path program 1 times [2020-10-20 08:02:26,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172355865] [2020-10-20 08:02:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172355865] [2020-10-20 08:02:26,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:26,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79394909] [2020-10-20 08:02:26,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:26,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:26,418 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-10-20 08:02:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:26,463 INFO L93 Difference]: Finished difference Result 129 states and 196 transitions. [2020-10-20 08:02:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:26,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 196 transitions. [2020-10-20 08:02:26,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-20 08:02:26,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 123 states and 190 transitions. [2020-10-20 08:02:26,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-10-20 08:02:26,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-10-20 08:02:26,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 190 transitions. [2020-10-20 08:02:26,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:26,483 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2020-10-20 08:02:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 190 transitions. [2020-10-20 08:02:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-10-20 08:02:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-20 08:02:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2020-10-20 08:02:26,523 INFO L714 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2020-10-20 08:02:26,523 INFO L594 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2020-10-20 08:02:26,523 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:02:26,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 190 transitions. [2020-10-20 08:02:26,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-20 08:02:26,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:26,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:26,527 INFO L852 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] [2020-10-20 08:02:26,527 INFO L853 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] [2020-10-20 08:02:26,528 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 281#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; 282#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 345#L250 assume !(1 == ~q_req_up~0); 375#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 333#L265-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 334#L270-1 assume !(0 == ~q_read_ev~0); 369#L303-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 371#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 354#L58 assume 1 == ~p_dw_pc~0; 309#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 310#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 357#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 358#L379 assume !(0 != activate_threads_~tmp~1); 387#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 295#L87 assume 1 == ~c_dr_pc~0; 296#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 297#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 298#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 269#L387 assume !(0 != activate_threads_~tmp___0~1); 270#L387-2 assume !(1 == ~q_read_ev~0); 275#L321-1 assume !(1 == ~q_write_ev~0); 278#L483-1 [2020-10-20 08:02:26,528 INFO L796 eck$LassoCheckResult]: Loop: 278#L483-1 assume !false; 312#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 302#L427 assume !false; 316#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 317#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 342#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 276#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 277#L407 assume !(0 != eval_~tmp___1~0); 381#L443 start_simulation_~kernel_st~0 := 2; 382#L250-2 assume !(1 == ~q_req_up~0); 363#L250-3 start_simulation_~kernel_st~0 := 3; 370#L303-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 366#L303-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 367#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 368#L58-3 assume 1 == ~p_dw_pc~0; 304#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 305#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 352#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 353#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 388#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 389#L87-3 assume 1 == ~c_dr_pc~0; 379#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 292#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 294#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 279#L387-3 assume !(0 != activate_threads_~tmp___0~1); 280#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 390#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 307#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 308#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 336#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 273#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 274#L502 assume !(0 == start_simulation_~tmp~4); 330#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 337#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 332#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 272#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 299#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 300#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 359#L515 assume !(0 != start_simulation_~tmp___0~3); 278#L483-1 [2020-10-20 08:02:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1395927454, now seen corresponding path program 1 times [2020-10-20 08:02:26,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313188561] [2020-10-20 08:02:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313188561] [2020-10-20 08:02:26,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:26,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868855659] [2020-10-20 08:02:26,615 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash -991429159, now seen corresponding path program 1 times [2020-10-20 08:02:26,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889896733] [2020-10-20 08:02:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889896733] [2020-10-20 08:02:26,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:26,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051311769] [2020-10-20 08:02:26,670 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:26,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:26,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:26,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:26,672 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. cyclomatic complexity: 68 Second operand 3 states. [2020-10-20 08:02:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:26,689 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2020-10-20 08:02:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:26,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 189 transitions. [2020-10-20 08:02:26,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-20 08:02:26,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 189 transitions. [2020-10-20 08:02:26,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-10-20 08:02:26,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-10-20 08:02:26,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 189 transitions. [2020-10-20 08:02:26,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:26,700 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2020-10-20 08:02:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 189 transitions. [2020-10-20 08:02:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-10-20 08:02:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-20 08:02:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2020-10-20 08:02:26,708 INFO L714 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2020-10-20 08:02:26,708 INFO L594 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2020-10-20 08:02:26,709 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:02:26,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 189 transitions. [2020-10-20 08:02:26,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-20 08:02:26,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:26,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:26,712 INFO L852 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] [2020-10-20 08:02:26,712 INFO L853 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] [2020-10-20 08:02:26,712 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 536#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; 537#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 600#L250 assume !(1 == ~q_req_up~0); 630#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 588#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 589#L270-1 assume !(0 == ~q_read_ev~0); 624#L303-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 626#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 609#L58 assume 1 == ~p_dw_pc~0; 564#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 565#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 613#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 614#L379 assume !(0 != activate_threads_~tmp~1); 642#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 550#L87 assume 1 == ~c_dr_pc~0; 551#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 552#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 553#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 524#L387 assume !(0 != activate_threads_~tmp___0~1); 525#L387-2 assume !(1 == ~q_read_ev~0); 530#L321-1 assume !(1 == ~q_write_ev~0); 533#L483-1 [2020-10-20 08:02:26,712 INFO L796 eck$LassoCheckResult]: Loop: 533#L483-1 assume !false; 567#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 557#L427 assume !false; 571#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 572#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 597#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 531#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 532#L407 assume !(0 != eval_~tmp___1~0); 636#L443 start_simulation_~kernel_st~0 := 2; 637#L250-2 assume !(1 == ~q_req_up~0); 618#L250-3 start_simulation_~kernel_st~0 := 3; 625#L303-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 621#L303-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 622#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 623#L58-3 assume 1 == ~p_dw_pc~0; 559#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 560#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 607#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 608#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 643#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 644#L87-3 assume 1 == ~c_dr_pc~0; 634#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 547#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 549#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 534#L387-3 assume !(0 != activate_threads_~tmp___0~1); 535#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 645#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 562#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 563#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 591#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 528#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 529#L502 assume !(0 == start_simulation_~tmp~4); 585#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 592#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 587#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 526#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 527#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 554#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 555#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 612#L515 assume !(0 != start_simulation_~tmp___0~3); 533#L483-1 [2020-10-20 08:02:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1310691940, now seen corresponding path program 1 times [2020-10-20 08:02:26,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886432545] [2020-10-20 08:02:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886432545] [2020-10-20 08:02:26,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:26,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268343897] [2020-10-20 08:02:26,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash -991429159, now seen corresponding path program 2 times [2020-10-20 08:02:26,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:26,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454825365] [2020-10-20 08:02:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:26,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454825365] [2020-10-20 08:02:26,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:26,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:26,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429401751] [2020-10-20 08:02:26,869 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:26,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:26,869 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. cyclomatic complexity: 67 Second operand 4 states. [2020-10-20 08:02:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:27,040 INFO L93 Difference]: Finished difference Result 251 states and 380 transitions. [2020-10-20 08:02:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:02:27,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 380 transitions. [2020-10-20 08:02:27,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 189 [2020-10-20 08:02:27,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 251 states and 380 transitions. [2020-10-20 08:02:27,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2020-10-20 08:02:27,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2020-10-20 08:02:27,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 380 transitions. [2020-10-20 08:02:27,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:27,049 INFO L691 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2020-10-20 08:02:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 380 transitions. [2020-10-20 08:02:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-10-20 08:02:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-20 08:02:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2020-10-20 08:02:27,068 INFO L714 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2020-10-20 08:02:27,068 INFO L594 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2020-10-20 08:02:27,068 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:02:27,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 380 transitions. [2020-10-20 08:02:27,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 189 [2020-10-20 08:02:27,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:27,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:27,072 INFO L852 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] [2020-10-20 08:02:27,072 INFO L853 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] [2020-10-20 08:02:27,072 INFO L794 eck$LassoCheckResult]: Stem: 1034#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 924#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; 925#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 994#L250 assume !(1 == ~q_req_up~0); 1035#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 977#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 978#L270-1 assume !(0 == ~q_read_ev~0); 1026#L303-1 assume !(0 == ~q_write_ev~0); 1029#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1007#L58 assume 1 == ~p_dw_pc~0; 952#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 953#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1010#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1011#L379 assume !(0 != activate_threads_~tmp~1); 1060#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 938#L87 assume 1 == ~c_dr_pc~0; 939#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 940#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 941#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 910#L387 assume !(0 != activate_threads_~tmp___0~1); 911#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 916#L321-1 assume !(1 == ~q_write_ev~0); 920#L483-1 [2020-10-20 08:02:27,073 INFO L796 eck$LassoCheckResult]: Loop: 920#L483-1 assume !false; 1094#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 1093#L427 assume !false; 1092#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1045#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 991#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 918#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 919#L407 assume !(0 != eval_~tmp___1~0); 1042#L443 start_simulation_~kernel_st~0 := 2; 1043#L250-2 assume !(1 == ~q_req_up~0); 1054#L250-3 start_simulation_~kernel_st~0 := 3; 1055#L303-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1021#L303-4 assume !(0 == ~q_write_ev~0); 1022#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1023#L58-3 assume 1 == ~p_dw_pc~0; 1024#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 1158#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1157#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1156#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1155#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1154#L87-3 assume 1 == ~c_dr_pc~0; 1153#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 1152#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1151#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1150#L387-3 assume !(0 != activate_threads_~tmp___0~1); 1068#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1069#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 1071#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1044#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 980#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 914#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 915#L502 assume !(0 == start_simulation_~tmp~4); 974#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 981#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 976#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 912#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 913#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 942#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 943#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1041#L515 assume !(0 != start_simulation_~tmp___0~3); 920#L483-1 [2020-10-20 08:02:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1704411616, now seen corresponding path program 1 times [2020-10-20 08:02:27,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833939868] [2020-10-20 08:02:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833939868] [2020-10-20 08:02:27,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:27,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056149664] [2020-10-20 08:02:27,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1500902249, now seen corresponding path program 1 times [2020-10-20 08:02:27,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232124332] [2020-10-20 08:02:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232124332] [2020-10-20 08:02:27,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:27,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478749469] [2020-10-20 08:02:27,203 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:27,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:27,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:27,204 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. cyclomatic complexity: 131 Second operand 5 states. [2020-10-20 08:02:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:27,396 INFO L93 Difference]: Finished difference Result 883 states and 1295 transitions. [2020-10-20 08:02:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:02:27,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1295 transitions. [2020-10-20 08:02:27,406 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 850 [2020-10-20 08:02:27,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 883 states and 1295 transitions. [2020-10-20 08:02:27,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2020-10-20 08:02:27,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 883 [2020-10-20 08:02:27,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 883 states and 1295 transitions. [2020-10-20 08:02:27,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:27,423 INFO L691 BuchiCegarLoop]: Abstraction has 883 states and 1295 transitions. [2020-10-20 08:02:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states and 1295 transitions. [2020-10-20 08:02:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 857. [2020-10-20 08:02:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2020-10-20 08:02:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1269 transitions. [2020-10-20 08:02:27,456 INFO L714 BuchiCegarLoop]: Abstraction has 857 states and 1269 transitions. [2020-10-20 08:02:27,456 INFO L594 BuchiCegarLoop]: Abstraction has 857 states and 1269 transitions. [2020-10-20 08:02:27,456 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:02:27,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 857 states and 1269 transitions. [2020-10-20 08:02:27,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 828 [2020-10-20 08:02:27,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:27,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:27,465 INFO L852 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] [2020-10-20 08:02:27,465 INFO L853 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] [2020-10-20 08:02:27,466 INFO L794 eck$LassoCheckResult]: Stem: 2171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 2072#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; 2073#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 2130#L250 assume !(1 == ~q_req_up~0); 2180#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2121#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2122#L270-1 assume !(0 == ~q_read_ev~0); 2159#L303-1 assume !(0 == ~q_write_ev~0); 2165#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2142#L58 assume !(1 == ~p_dw_pc~0); 2143#L58-2 assume !(2 == ~p_dw_pc~0); 2161#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 2189#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2144#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2145#L379 assume !(0 != activate_threads_~tmp~1); 2190#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2086#L87 assume 1 == ~c_dr_pc~0; 2087#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 2088#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2089#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2059#L387 assume !(0 != activate_threads_~tmp___0~1); 2060#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2065#L321-1 assume !(1 == ~q_write_ev~0); 2069#L483-1 [2020-10-20 08:02:27,466 INFO L796 eck$LassoCheckResult]: Loop: 2069#L483-1 assume !false; 2100#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 2093#L427 assume !false; 2104#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2105#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2127#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2067#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 2068#L407 assume !(0 != eval_~tmp___1~0); 2178#L443 start_simulation_~kernel_st~0 := 2; 2179#L250-2 assume !(1 == ~q_req_up~0); 2185#L250-3 start_simulation_~kernel_st~0 := 3; 2913#L303-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2912#L303-4 assume !(0 == ~q_write_ev~0); 2911#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2156#L58-3 assume !(1 == ~p_dw_pc~0); 2152#L58-5 assume !(2 == ~p_dw_pc~0); 2153#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 2198#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2140#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2141#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2192#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2195#L87-3 assume 1 == ~c_dr_pc~0; 2175#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 2083#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2085#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2070#L387-3 assume !(0 != activate_threads_~tmp___0~1); 2071#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2196#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 2098#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2099#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2124#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2063#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 2064#L502 assume !(0 == start_simulation_~tmp~4); 2118#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 2125#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2120#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2061#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 2062#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 2090#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 2091#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 2146#L515 assume !(0 != start_simulation_~tmp___0~3); 2069#L483-1 [2020-10-20 08:02:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1443448551, now seen corresponding path program 1 times [2020-10-20 08:02:27,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513061283] [2020-10-20 08:02:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513061283] [2020-10-20 08:02:27,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:27,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134560302] [2020-10-20 08:02:27,556 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2013296618, now seen corresponding path program 1 times [2020-10-20 08:02:27,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232783292] [2020-10-20 08:02:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232783292] [2020-10-20 08:02:27,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:27,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814392338] [2020-10-20 08:02:27,620 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:27,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:27,623 INFO L87 Difference]: Start difference. First operand 857 states and 1269 transitions. cyclomatic complexity: 416 Second operand 5 states. [2020-10-20 08:02:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:27,789 INFO L93 Difference]: Finished difference Result 2083 states and 2999 transitions. [2020-10-20 08:02:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:02:27,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2083 states and 2999 transitions. [2020-10-20 08:02:27,806 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2044 [2020-10-20 08:02:27,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2083 states to 2083 states and 2999 transitions. [2020-10-20 08:02:27,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2083 [2020-10-20 08:02:27,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2083 [2020-10-20 08:02:27,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2083 states and 2999 transitions. [2020-10-20 08:02:27,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:27,827 INFO L691 BuchiCegarLoop]: Abstraction has 2083 states and 2999 transitions. [2020-10-20 08:02:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states and 2999 transitions. [2020-10-20 08:02:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2017. [2020-10-20 08:02:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2020-10-20 08:02:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2913 transitions. [2020-10-20 08:02:27,864 INFO L714 BuchiCegarLoop]: Abstraction has 2017 states and 2913 transitions. [2020-10-20 08:02:27,864 INFO L594 BuchiCegarLoop]: Abstraction has 2017 states and 2913 transitions. [2020-10-20 08:02:27,864 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:02:27,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2017 states and 2913 transitions. [2020-10-20 08:02:27,875 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1980 [2020-10-20 08:02:27,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:27,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:27,877 INFO L852 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] [2020-10-20 08:02:27,877 INFO L853 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] [2020-10-20 08:02:27,878 INFO L794 eck$LassoCheckResult]: Stem: 5131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 5028#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; 5029#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 5089#L250 assume !(1 == ~q_req_up~0); 5140#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5076#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5077#L270-1 assume !(0 == ~q_read_ev~0); 5123#L303-1 assume !(0 == ~q_write_ev~0); 5128#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 5101#L58 assume !(1 == ~p_dw_pc~0); 5102#L58-2 assume !(2 == ~p_dw_pc~0); 5124#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 5147#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5104#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5105#L379 assume !(0 != activate_threads_~tmp~1); 5148#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5041#L87 assume !(1 == ~c_dr_pc~0); 5030#L87-2 assume !(2 == ~c_dr_pc~0); 5031#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 5091#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5042#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5014#L387 assume !(0 != activate_threads_~tmp___0~1); 5015#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 5020#L321-1 assume !(1 == ~q_write_ev~0); 5026#L483-1 [2020-10-20 08:02:27,878 INFO L796 eck$LassoCheckResult]: Loop: 5026#L483-1 assume !false; 5302#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 5295#L427 assume !false; 5296#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5292#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5291#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5286#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 5287#L407 assume !(0 != eval_~tmp___1~0); 5361#L443 start_simulation_~kernel_st~0 := 2; 5359#L250-2 assume !(1 == ~q_req_up~0); 5357#L250-3 start_simulation_~kernel_st~0 := 3; 5354#L303-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 5355#L303-4 assume !(0 == ~q_write_ev~0); 5396#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 5395#L58-3 assume !(1 == ~p_dw_pc~0); 5394#L58-5 assume !(2 == ~p_dw_pc~0); 5393#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 5392#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5391#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5390#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 5389#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5388#L87-3 assume !(1 == ~c_dr_pc~0); 5387#L87-5 assume !(2 == ~c_dr_pc~0); 5386#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 5385#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5384#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5383#L387-3 assume !(0 != activate_threads_~tmp___0~1); 5382#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 5329#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 5326#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5380#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5379#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5378#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 5376#L502 assume !(0 == start_simulation_~tmp~4); 5374#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 5372#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5371#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5370#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 5369#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 5368#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 5367#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 5366#L515 assume !(0 != start_simulation_~tmp___0~3); 5026#L483-1 [2020-10-20 08:02:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396684, now seen corresponding path program 1 times [2020-10-20 08:02:27,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381852378] [2020-10-20 08:02:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381852378] [2020-10-20 08:02:27,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:27,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436649367] [2020-10-20 08:02:27,929 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1862222361, now seen corresponding path program 1 times [2020-10-20 08:02:27,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:27,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487789119] [2020-10-20 08:02:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:27,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487789119] [2020-10-20 08:02:27,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:27,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:27,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119526414] [2020-10-20 08:02:27,968 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:27,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:27,969 INFO L87 Difference]: Start difference. First operand 2017 states and 2913 transitions. cyclomatic complexity: 904 Second operand 3 states. [2020-10-20 08:02:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:28,009 INFO L93 Difference]: Finished difference Result 2666 states and 3813 transitions. [2020-10-20 08:02:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:28,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2666 states and 3813 transitions. [2020-10-20 08:02:28,031 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2630 [2020-10-20 08:02:28,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2666 states to 2666 states and 3813 transitions. [2020-10-20 08:02:28,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2666 [2020-10-20 08:02:28,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2666 [2020-10-20 08:02:28,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2666 states and 3813 transitions. [2020-10-20 08:02:28,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:28,057 INFO L691 BuchiCegarLoop]: Abstraction has 2666 states and 3813 transitions. [2020-10-20 08:02:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states and 3813 transitions. [2020-10-20 08:02:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1680. [2020-10-20 08:02:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2020-10-20 08:02:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2417 transitions. [2020-10-20 08:02:28,318 INFO L714 BuchiCegarLoop]: Abstraction has 1680 states and 2417 transitions. [2020-10-20 08:02:28,318 INFO L594 BuchiCegarLoop]: Abstraction has 1680 states and 2417 transitions. [2020-10-20 08:02:28,318 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:02:28,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1680 states and 2417 transitions. [2020-10-20 08:02:28,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1650 [2020-10-20 08:02:28,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:28,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:28,328 INFO L852 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] [2020-10-20 08:02:28,328 INFO L853 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] [2020-10-20 08:02:28,328 INFO L794 eck$LassoCheckResult]: Stem: 9825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 9718#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; 9719#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 9781#L250 assume !(1 == ~q_req_up~0); 9834#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 9768#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9769#L270-1 assume !(0 == ~q_read_ev~0); 9815#L303-1 assume !(0 == ~q_write_ev~0); 9821#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 9796#L58 assume !(1 == ~p_dw_pc~0); 9797#L58-2 assume !(2 == ~p_dw_pc~0); 9816#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 9843#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9799#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 9800#L379 assume !(0 != activate_threads_~tmp~1); 9844#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9731#L87 assume !(1 == ~c_dr_pc~0); 9720#L87-2 assume !(2 == ~c_dr_pc~0); 9721#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 9784#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9732#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 9706#L387 assume !(0 != activate_threads_~tmp___0~1); 9707#L387-2 assume !(1 == ~q_read_ev~0); 9712#L321-1 assume !(1 == ~q_write_ev~0); 9717#L483-1 [2020-10-20 08:02:28,329 INFO L796 eck$LassoCheckResult]: Loop: 9717#L483-1 assume !false; 9961#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 9959#L427 assume !false; 9958#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9954#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 9949#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9946#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 9941#L407 assume !(0 != eval_~tmp___1~0); 9942#L443 start_simulation_~kernel_st~0 := 2; 10129#L250-2 assume !(1 == ~q_req_up~0); 10128#L250-3 start_simulation_~kernel_st~0 := 3; 10126#L303-2 assume !(0 == ~q_read_ev~0); 10124#L303-4 assume !(0 == ~q_write_ev~0); 10123#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 10122#L58-3 assume !(1 == ~p_dw_pc~0); 10120#L58-5 assume !(2 == ~p_dw_pc~0); 10117#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 10114#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10111#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 10108#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10105#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10099#L87-3 assume !(1 == ~c_dr_pc~0); 10094#L87-5 assume !(2 == ~c_dr_pc~0); 10093#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 10092#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10090#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10088#L387-3 assume !(0 != activate_threads_~tmp___0~1); 10068#L387-5 assume !(1 == ~q_read_ev~0); 10059#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 10053#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10045#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10039#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10033#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 10026#L502 assume !(0 == start_simulation_~tmp~4); 10020#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 10011#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10005#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10000#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 9994#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 9989#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 9972#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 9969#L515 assume !(0 != start_simulation_~tmp___0~3); 9717#L483-1 [2020-10-20 08:02:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 1 times [2020-10-20 08:02:28,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931150741] [2020-10-20 08:02:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:28,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:28,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:28,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1854481131, now seen corresponding path program 1 times [2020-10-20 08:02:28,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463618849] [2020-10-20 08:02:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:28,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463618849] [2020-10-20 08:02:28,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:28,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:28,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819252559] [2020-10-20 08:02:28,443 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:28,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:28,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:28,444 INFO L87 Difference]: Start difference. First operand 1680 states and 2417 transitions. cyclomatic complexity: 741 Second operand 5 states. [2020-10-20 08:02:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:28,542 INFO L93 Difference]: Finished difference Result 2816 states and 3974 transitions. [2020-10-20 08:02:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:02:28,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2816 states and 3974 transitions. [2020-10-20 08:02:28,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2780 [2020-10-20 08:02:28,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2816 states to 2816 states and 3974 transitions. [2020-10-20 08:02:28,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2816 [2020-10-20 08:02:28,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2816 [2020-10-20 08:02:28,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2816 states and 3974 transitions. [2020-10-20 08:02:28,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:28,616 INFO L691 BuchiCegarLoop]: Abstraction has 2816 states and 3974 transitions. [2020-10-20 08:02:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states and 3974 transitions. [2020-10-20 08:02:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 1743. [2020-10-20 08:02:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2020-10-20 08:02:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2480 transitions. [2020-10-20 08:02:28,651 INFO L714 BuchiCegarLoop]: Abstraction has 1743 states and 2480 transitions. [2020-10-20 08:02:28,651 INFO L594 BuchiCegarLoop]: Abstraction has 1743 states and 2480 transitions. [2020-10-20 08:02:28,651 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:02:28,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1743 states and 2480 transitions. [2020-10-20 08:02:28,660 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1713 [2020-10-20 08:02:28,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:28,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:28,661 INFO L852 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] [2020-10-20 08:02:28,661 INFO L853 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] [2020-10-20 08:02:28,661 INFO L794 eck$LassoCheckResult]: Stem: 14336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 14230#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; 14231#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 14292#L250 assume !(1 == ~q_req_up~0); 14347#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 14279#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 14280#L270-1 assume !(0 == ~q_read_ev~0); 14328#L303-1 assume !(0 == ~q_write_ev~0); 14332#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 14309#L58 assume !(1 == ~p_dw_pc~0); 14310#L58-2 assume !(2 == ~p_dw_pc~0); 14329#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 14358#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 14312#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 14313#L379 assume !(0 != activate_threads_~tmp~1); 14359#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 14244#L87 assume !(1 == ~c_dr_pc~0); 14232#L87-2 assume !(2 == ~c_dr_pc~0); 14233#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 14297#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 14245#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 14218#L387 assume !(0 != activate_threads_~tmp___0~1); 14219#L387-2 assume !(1 == ~q_read_ev~0); 14224#L321-1 assume !(1 == ~q_write_ev~0); 14229#L483-1 [2020-10-20 08:02:28,662 INFO L796 eck$LassoCheckResult]: Loop: 14229#L483-1 assume !false; 15230#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 15209#L427 assume !false; 15128#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 15123#L283 assume !(0 == ~p_dw_st~0); 15122#L287 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 15121#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15073#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 15066#L407 assume !(0 != eval_~tmp___1~0); 15067#L443 start_simulation_~kernel_st~0 := 2; 15355#L250-2 assume !(1 == ~q_req_up~0); 15354#L250-3 start_simulation_~kernel_st~0 := 3; 15353#L303-2 assume !(0 == ~q_read_ev~0); 15352#L303-4 assume !(0 == ~q_write_ev~0); 15351#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 15350#L58-3 assume !(1 == ~p_dw_pc~0); 15349#L58-5 assume !(2 == ~p_dw_pc~0); 15348#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 15347#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15346#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 15345#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 15344#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15343#L87-3 assume !(1 == ~c_dr_pc~0); 15342#L87-5 assume !(2 == ~c_dr_pc~0); 15341#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 15340#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15339#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 15338#L387-3 assume !(0 != activate_threads_~tmp___0~1); 15337#L387-5 assume !(1 == ~q_read_ev~0); 15336#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 15335#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 15333#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 15311#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15306#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 15300#L502 assume !(0 == start_simulation_~tmp~4); 15294#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 15292#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 15286#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15279#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 15276#L457 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 15249#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 15245#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 15241#L515 assume !(0 != start_simulation_~tmp___0~3); 14229#L483-1 [2020-10-20 08:02:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 2 times [2020-10-20 08:02:28,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612240796] [2020-10-20 08:02:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:28,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:28,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:28,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1150388166, now seen corresponding path program 1 times [2020-10-20 08:02:28,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114519715] [2020-10-20 08:02:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:28,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114519715] [2020-10-20 08:02:28,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:28,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:28,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235092683] [2020-10-20 08:02:28,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:28,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:28,720 INFO L87 Difference]: Start difference. First operand 1743 states and 2480 transitions. cyclomatic complexity: 741 Second operand 5 states. [2020-10-20 08:02:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:28,861 INFO L93 Difference]: Finished difference Result 4894 states and 7018 transitions. [2020-10-20 08:02:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:02:28,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4894 states and 7018 transitions. [2020-10-20 08:02:28,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4846 [2020-10-20 08:02:28,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4894 states to 4894 states and 7018 transitions. [2020-10-20 08:02:28,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4894 [2020-10-20 08:02:28,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4894 [2020-10-20 08:02:28,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4894 states and 7018 transitions. [2020-10-20 08:02:28,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:28,948 INFO L691 BuchiCegarLoop]: Abstraction has 4894 states and 7018 transitions. [2020-10-20 08:02:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states and 7018 transitions. [2020-10-20 08:02:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 1806. [2020-10-20 08:02:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2020-10-20 08:02:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2543 transitions. [2020-10-20 08:02:29,073 INFO L714 BuchiCegarLoop]: Abstraction has 1806 states and 2543 transitions. [2020-10-20 08:02:29,073 INFO L594 BuchiCegarLoop]: Abstraction has 1806 states and 2543 transitions. [2020-10-20 08:02:29,073 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:02:29,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1806 states and 2543 transitions. [2020-10-20 08:02:29,081 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1776 [2020-10-20 08:02:29,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,083 INFO L852 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] [2020-10-20 08:02:29,083 INFO L853 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] [2020-10-20 08:02:29,083 INFO L794 eck$LassoCheckResult]: Stem: 20996#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 20884#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; 20885#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 20948#L250 assume !(1 == ~q_req_up~0); 21004#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 20934#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 20935#L270-1 assume !(0 == ~q_read_ev~0); 20986#L303-1 assume !(0 == ~q_write_ev~0); 20992#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 20964#L58 assume !(1 == ~p_dw_pc~0); 20965#L58-2 assume !(2 == ~p_dw_pc~0); 20987#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 21014#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 20967#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 20968#L379 assume !(0 != activate_threads_~tmp~1); 21015#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 20897#L87 assume !(1 == ~c_dr_pc~0); 20886#L87-2 assume !(2 == ~c_dr_pc~0); 20887#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 20952#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 20898#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 20872#L387 assume !(0 != activate_threads_~tmp___0~1); 20873#L387-2 assume !(1 == ~q_read_ev~0); 20878#L321-1 assume !(1 == ~q_write_ev~0); 20883#L483-1 [2020-10-20 08:02:29,084 INFO L796 eck$LassoCheckResult]: Loop: 20883#L483-1 assume !false; 22601#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 22403#L427 assume !false; 21668#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 21667#L283 assume !(0 == ~p_dw_st~0); 21665#L287 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 21664#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 21663#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 21660#L407 assume !(0 != eval_~tmp___1~0); 21662#L443 start_simulation_~kernel_st~0 := 2; 21656#L250-2 assume !(1 == ~q_req_up~0); 21657#L250-3 start_simulation_~kernel_st~0 := 3; 22550#L303-2 assume !(0 == ~q_read_ev~0); 21652#L303-4 assume !(0 == ~q_write_ev~0); 21650#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 21651#L58-3 assume !(1 == ~p_dw_pc~0); 20979#L58-5 assume !(2 == ~p_dw_pc~0); 20980#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 21035#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 21036#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 21016#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 21017#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 21023#L87-3 assume !(1 == ~c_dr_pc~0); 21021#L87-5 assume !(2 == ~c_dr_pc~0); 21022#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 22668#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 20896#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 20881#L387-3 assume !(0 != activate_threads_~tmp___0~1); 20882#L387-5 assume !(1 == ~q_read_ev~0); 21028#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 21029#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 22642#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 22640#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 22638#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 20928#L502 assume !(0 == start_simulation_~tmp~4); 20930#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 21010#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 20932#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 20943#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 20977#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 20978#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 22603#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 22602#L515 assume !(0 != start_simulation_~tmp___0~3); 20883#L483-1 [2020-10-20 08:02:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 3 times [2020-10-20 08:02:29,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214835895] [2020-10-20 08:02:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,109 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1150447748, now seen corresponding path program 1 times [2020-10-20 08:02:29,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211710596] [2020-10-20 08:02:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211710596] [2020-10-20 08:02:29,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:29,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351308595] [2020-10-20 08:02:29,168 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:29,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:29,170 INFO L87 Difference]: Start difference. First operand 1806 states and 2543 transitions. cyclomatic complexity: 741 Second operand 5 states. [2020-10-20 08:02:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:29,312 INFO L93 Difference]: Finished difference Result 4256 states and 5966 transitions. [2020-10-20 08:02:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:02:29,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4256 states and 5966 transitions. [2020-10-20 08:02:29,337 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4222 [2020-10-20 08:02:29,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4256 states to 4256 states and 5966 transitions. [2020-10-20 08:02:29,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4256 [2020-10-20 08:02:29,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4256 [2020-10-20 08:02:29,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4256 states and 5966 transitions. [2020-10-20 08:02:29,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:29,378 INFO L691 BuchiCegarLoop]: Abstraction has 4256 states and 5966 transitions. [2020-10-20 08:02:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states and 5966 transitions. [2020-10-20 08:02:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 1884. [2020-10-20 08:02:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2020-10-20 08:02:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2604 transitions. [2020-10-20 08:02:29,426 INFO L714 BuchiCegarLoop]: Abstraction has 1884 states and 2604 transitions. [2020-10-20 08:02:29,426 INFO L594 BuchiCegarLoop]: Abstraction has 1884 states and 2604 transitions. [2020-10-20 08:02:29,426 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:02:29,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1884 states and 2604 transitions. [2020-10-20 08:02:29,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1854 [2020-10-20 08:02:29,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,436 INFO L852 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] [2020-10-20 08:02:29,436 INFO L853 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] [2020-10-20 08:02:29,436 INFO L794 eck$LassoCheckResult]: Stem: 27065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 26959#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; 26960#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 27020#L250 assume !(1 == ~q_req_up~0); 27075#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 27007#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 27008#L270-1 assume !(0 == ~q_read_ev~0); 27054#L303-1 assume !(0 == ~q_write_ev~0); 27060#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 27035#L58 assume !(1 == ~p_dw_pc~0); 27036#L58-2 assume !(2 == ~p_dw_pc~0); 27055#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 27085#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 27038#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 27039#L379 assume !(0 != activate_threads_~tmp~1); 27086#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 26972#L87 assume !(1 == ~c_dr_pc~0); 26961#L87-2 assume !(2 == ~c_dr_pc~0); 26962#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 27024#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 26973#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 26947#L387 assume !(0 != activate_threads_~tmp___0~1); 26948#L387-2 assume !(1 == ~q_read_ev~0); 26953#L321-1 assume !(1 == ~q_write_ev~0); 26958#L483-1 [2020-10-20 08:02:29,437 INFO L796 eck$LassoCheckResult]: Loop: 26958#L483-1 assume !false; 27175#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 27160#L427 assume !false; 27174#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 27173#L283 assume !(0 == ~p_dw_st~0); 27172#L287 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 27171#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 27169#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 27166#L407 assume !(0 != eval_~tmp___1~0); 27167#L443 start_simulation_~kernel_st~0 := 2; 27230#L250-2 assume !(1 == ~q_req_up~0); 27229#L250-3 start_simulation_~kernel_st~0 := 3; 27228#L303-2 assume !(0 == ~q_read_ev~0); 27227#L303-4 assume !(0 == ~q_write_ev~0); 27226#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 27225#L58-3 assume !(1 == ~p_dw_pc~0); 27224#L58-5 assume !(2 == ~p_dw_pc~0); 27223#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 27222#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 27221#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 27219#L379-3 assume !(0 != activate_threads_~tmp~1); 27217#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 27215#L87-3 assume !(1 == ~c_dr_pc~0); 27213#L87-5 assume !(2 == ~c_dr_pc~0); 27211#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 27209#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 27207#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 27205#L387-3 assume !(0 != activate_threads_~tmp___0~1); 27203#L387-5 assume !(1 == ~q_read_ev~0); 27201#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 27199#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 27196#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 27194#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 27192#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 27189#L502 assume !(0 == start_simulation_~tmp~4); 27187#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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; 27186#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 27184#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 27182#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 27180#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 27178#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 27177#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 27176#L515 assume !(0 != start_simulation_~tmp___0~3); 26958#L483-1 [2020-10-20 08:02:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 4 times [2020-10-20 08:02:29,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143355941] [2020-10-20 08:02:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,465 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1339081214, now seen corresponding path program 1 times [2020-10-20 08:02:29,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732662528] [2020-10-20 08:02:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732662528] [2020-10-20 08:02:29,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:29,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316159360] [2020-10-20 08:02:29,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:29,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:29,490 INFO L87 Difference]: Start difference. First operand 1884 states and 2604 transitions. cyclomatic complexity: 724 Second operand 3 states. [2020-10-20 08:02:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:29,702 INFO L93 Difference]: Finished difference Result 2893 states and 3910 transitions. [2020-10-20 08:02:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:29,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2893 states and 3910 transitions. [2020-10-20 08:02:29,720 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2858 [2020-10-20 08:02:29,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2893 states to 2893 states and 3910 transitions. [2020-10-20 08:02:29,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2893 [2020-10-20 08:02:29,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2893 [2020-10-20 08:02:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2893 states and 3910 transitions. [2020-10-20 08:02:29,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:29,749 INFO L691 BuchiCegarLoop]: Abstraction has 2893 states and 3910 transitions. [2020-10-20 08:02:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states and 3910 transitions. [2020-10-20 08:02:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2893. [2020-10-20 08:02:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2020-10-20 08:02:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3910 transitions. [2020-10-20 08:02:29,810 INFO L714 BuchiCegarLoop]: Abstraction has 2893 states and 3910 transitions. [2020-10-20 08:02:29,810 INFO L594 BuchiCegarLoop]: Abstraction has 2893 states and 3910 transitions. [2020-10-20 08:02:29,811 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:02:29,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2893 states and 3910 transitions. [2020-10-20 08:02:29,826 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2858 [2020-10-20 08:02:29,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,830 INFO L852 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] [2020-10-20 08:02:29,830 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:29,830 INFO L794 eck$LassoCheckResult]: Stem: 31848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 31742#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; 31743#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 31805#L250 assume !(1 == ~q_req_up~0); 31858#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 31792#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 31793#L270-1 assume !(0 == ~q_read_ev~0); 31840#L303-1 assume !(0 == ~q_write_ev~0); 31843#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 31821#L58 assume !(1 == ~p_dw_pc~0); 31822#L58-2 assume !(2 == ~p_dw_pc~0); 31842#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 31869#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 31823#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 31824#L379 assume !(0 != activate_threads_~tmp~1); 31872#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 31755#L87 assume !(1 == ~c_dr_pc~0); 31744#L87-2 assume !(2 == ~c_dr_pc~0); 31745#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 31809#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 31756#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 31730#L387 assume !(0 != activate_threads_~tmp___0~1); 31731#L387-2 assume !(1 == ~q_read_ev~0); 31736#L321-1 assume !(1 == ~q_write_ev~0); 31739#L483-1 assume !false; 34096#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 34023#L427 [2020-10-20 08:02:29,831 INFO L796 eck$LassoCheckResult]: Loop: 34023#L427 assume !false; 34089#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 34084#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 34080#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 34067#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 34064#L407 assume 0 != eval_~tmp___1~0; 34060#L407-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 31829#L416 assume !(0 != eval_~tmp~2); 31830#L412 assume !(0 == ~c_dr_st~0); 34023#L427 [2020-10-20 08:02:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 1 times [2020-10-20 08:02:29,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470847552] [2020-10-20 08:02:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1127629257, now seen corresponding path program 1 times [2020-10-20 08:02:29,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022414282] [2020-10-20 08:02:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:29,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:29,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -644372706, now seen corresponding path program 1 times [2020-10-20 08:02:29,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746490796] [2020-10-20 08:02:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746490796] [2020-10-20 08:02:29,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:29,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483685660] [2020-10-20 08:02:30,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:30,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:30,022 INFO L87 Difference]: Start difference. First operand 2893 states and 3910 transitions. cyclomatic complexity: 1024 Second operand 3 states. [2020-10-20 08:02:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,078 INFO L93 Difference]: Finished difference Result 4193 states and 5650 transitions. [2020-10-20 08:02:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:30,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4193 states and 5650 transitions. [2020-10-20 08:02:30,106 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 4159 [2020-10-20 08:02:30,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4193 states to 4193 states and 5650 transitions. [2020-10-20 08:02:30,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4193 [2020-10-20 08:02:30,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4193 [2020-10-20 08:02:30,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4193 states and 5650 transitions. [2020-10-20 08:02:30,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,144 INFO L691 BuchiCegarLoop]: Abstraction has 4193 states and 5650 transitions. [2020-10-20 08:02:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states and 5650 transitions. [2020-10-20 08:02:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 3691. [2020-10-20 08:02:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2020-10-20 08:02:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5011 transitions. [2020-10-20 08:02:30,322 INFO L714 BuchiCegarLoop]: Abstraction has 3691 states and 5011 transitions. [2020-10-20 08:02:30,322 INFO L594 BuchiCegarLoop]: Abstraction has 3691 states and 5011 transitions. [2020-10-20 08:02:30,322 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:02:30,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3691 states and 5011 transitions. [2020-10-20 08:02:30,341 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3657 [2020-10-20 08:02:30,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,342 INFO L852 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] [2020-10-20 08:02:30,343 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,343 INFO L794 eck$LassoCheckResult]: Stem: 38944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 38837#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; 38838#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 38900#L250 assume !(1 == ~q_req_up~0); 38953#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 38885#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 38886#L270-1 assume !(0 == ~q_read_ev~0); 38935#L303-1 assume !(0 == ~q_write_ev~0); 38939#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 38915#L58 assume !(1 == ~p_dw_pc~0); 38916#L58-2 assume !(2 == ~p_dw_pc~0); 38938#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 38962#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 38917#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 38918#L379 assume !(0 != activate_threads_~tmp~1); 38964#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 38850#L87 assume !(1 == ~c_dr_pc~0); 38839#L87-2 assume !(2 == ~c_dr_pc~0); 38840#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 38906#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 38851#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 38824#L387 assume !(0 != activate_threads_~tmp___0~1); 38825#L387-2 assume !(1 == ~q_read_ev~0); 38830#L321-1 assume !(1 == ~q_write_ev~0); 38833#L483-1 assume !false; 39686#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, 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; 39684#L427 [2020-10-20 08:02:30,343 INFO L796 eck$LassoCheckResult]: Loop: 39684#L427 assume !false; 39681#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 39677#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 39674#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 39672#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 39667#L407 assume 0 != eval_~tmp___1~0; 39662#L407-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 39657#L416 assume !(0 != eval_~tmp~2); 39658#L412 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet14;havoc eval_#t~nondet14; 39687#L431 assume !(0 != eval_~tmp___0~2); 39684#L427 [2020-10-20 08:02:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 2 times [2020-10-20 08:02:30,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175145123] [2020-10-20 08:02:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,371 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash 596766935, now seen corresponding path program 1 times [2020-10-20 08:02:30,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822696292] [2020-10-20 08:02:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1499280930, now seen corresponding path program 1 times [2020-10-20 08:02:30,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646863307] [2020-10-20 08:02:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,407 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:31,318 WARN L193 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 133 [2020-10-20 08:02:31,568 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-20 08:02:31,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:02:31 BoogieIcfgContainer [2020-10-20 08:02:31,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:02:31,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:02:31,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:02:31,629 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:02:31,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:25" (3/4) ... [2020-10-20 08:02:31,634 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:02:31,740 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:02:31,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:02:31,744 INFO L168 Benchmark]: Toolchain (without parser) took 7016.59 ms. Allocated memory was 35.7 MB in the beginning and 135.3 MB in the end (delta: 99.6 MB). Free memory was 9.2 MB in the beginning and 96.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,744 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 35.1 MB. Free memory was 13.9 MB in the beginning and 13.9 MB in the end (delta: 52.3 kB). Peak memory consumption was 52.3 kB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.13 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 8.3 MB in the beginning and 24.3 MB in the end (delta: -16.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.05 ms. Allocated memory is still 45.1 MB. Free memory was 24.3 MB in the beginning and 21.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,746 INFO L168 Benchmark]: Boogie Preprocessor took 57.79 ms. Allocated memory is still 45.1 MB. Free memory was 21.4 MB in the beginning and 19.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,746 INFO L168 Benchmark]: RCFGBuilder took 674.76 ms. Allocated memory was 45.1 MB in the beginning and 47.2 MB in the end (delta: 2.1 MB). Free memory was 19.3 MB in the beginning and 12.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,747 INFO L168 Benchmark]: BuchiAutomizer took 5670.08 ms. Allocated memory was 47.2 MB in the beginning and 135.3 MB in the end (delta: 88.1 MB). Free memory was 12.8 MB in the beginning and 99.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 77.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,750 INFO L168 Benchmark]: Witness Printer took 111.62 ms. Allocated memory is still 135.3 MB. Free memory was 99.6 MB in the beginning and 96.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:31,752 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 35.1 MB. Free memory was 13.9 MB in the beginning and 13.9 MB in the end (delta: 52.3 kB). Peak memory consumption was 52.3 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 421.13 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 8.3 MB in the beginning and 24.3 MB in the end (delta: -16.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 68.05 ms. Allocated memory is still 45.1 MB. Free memory was 24.3 MB in the beginning and 21.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 57.79 ms. Allocated memory is still 45.1 MB. Free memory was 21.4 MB in the beginning and 19.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 674.76 ms. Allocated memory was 45.1 MB in the beginning and 47.2 MB in the end (delta: 2.1 MB). Free memory was 19.3 MB in the beginning and 12.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 5670.08 ms. Allocated memory was 47.2 MB in the beginning and 135.3 MB in the end (delta: 88.1 MB). Free memory was 12.8 MB in the beginning and 99.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 77.6 MB. Max. memory is 14.3 GB. * Witness Printer took 111.62 ms. Allocated memory is still 135.3 MB. Free memory was 99.6 MB in the beginning and 96.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 3691 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 8113 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 3691 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2157 SDtfs, 3669 SDslu, 3394 SDs, 0 SdLazy, 395 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI6 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: 402]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {a_t=0, NULL=0, NULL=1, c_num_read=0, tmp=0, kernel_st=1, q_read_ev=2, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3685ed1e=0, p_dw_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f26945f=0, NULL=0, NULL=0, q_free=1, fast_clk_edge=2, __retres1=0, tmp___0=0, q_ev=0, slow_clk_edge=2, tmp___0=0, NULL=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c5cbada=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42021276=0, tmp=0, __retres1=0, p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=4, \result=0, \result=0, c_dr_st=0, p_dw_i=1, tmp___1=1, q_req_up=0, q_write_ev=2, __retres1=1, NULL=2, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@326ca98a=0, NULL=0, NULL=3, p_dw_st=0, \result=0, c_last_read=0, q_buf_0=0, p_num_write=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@647006dd=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@997adb1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 402]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int fast_clk_edge ; [L17] int slow_clk_edge ; [L18] int q_buf_0 ; [L19] int q_free ; [L20] int q_read_ev ; [L21] int q_write_ev ; [L22] int q_req_up ; [L23] int q_ev ; [L44] int p_num_write ; [L45] int p_last_write ; [L46] int p_dw_st ; [L47] int p_dw_pc ; [L48] int p_dw_i ; [L49] int c_num_read ; [L50] int c_last_read ; [L51] int c_dr_st ; [L52] int c_dr_pc ; [L53] int c_dr_i ; [L186] static int a_t ; [L336] static int t = 0; [L547] int __retres1 ; [L531] fast_clk_edge = 2 [L532] slow_clk_edge = 2 [L533] q_free = 1 [L534] q_write_ev = 2 [L535] q_read_ev = q_write_ev [L536] p_num_write = 0 [L537] p_dw_pc = 0 [L538] p_dw_i = 1 [L539] c_num_read = 0 [L540] c_dr_pc = 0 [L541] c_dr_i = 1 [L469] int kernel_st ; [L470] int tmp ; [L471] int tmp___0 ; [L475] kernel_st = 0 [L250] COND FALSE !((int )q_req_up == 1) [L265] COND TRUE (int )p_dw_i == 1 [L266] p_dw_st = 0 [L270] COND TRUE (int )c_dr_i == 1 [L271] c_dr_st = 0 [L303] COND FALSE !((int )q_read_ev == 0) [L308] COND FALSE !((int )q_write_ev == 0) [L372] int tmp ; [L373] int tmp___0 ; [L55] int __retres1 ; [L58] COND FALSE !((int )p_dw_pc == 1) [L68] COND FALSE !((int )p_dw_pc == 2) [L78] __retres1 = 0 [L80] return (__retres1); [L377] tmp = is_do_write_p_triggered() [L379] COND FALSE !(\read(tmp)) [L84] int __retres1 ; [L87] COND FALSE !((int )c_dr_pc == 1) [L97] COND FALSE !((int )c_dr_pc == 2) [L107] __retres1 = 0 [L109] return (__retres1); [L385] tmp___0 = is_do_read_c_triggered() [L387] COND FALSE !(\read(tmp___0)) [L321] COND FALSE !((int )q_read_ev == 1) [L326] COND FALSE !((int )q_write_ev == 1) [L483] COND TRUE 1 [L486] kernel_st = 1 [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; Loop: [L402] COND TRUE 1 [L280] int __retres1 ; [L283] COND TRUE (int )p_dw_st == 0 [L284] __retres1 = 1 [L296] return (__retres1); [L405] tmp___1 = exists_runnable_thread() [L407] COND TRUE \read(tmp___1) [L412] COND TRUE (int )p_dw_st == 0 [L414] tmp = __VERIFIER_nondet_int() [L416] COND FALSE !(\read(tmp)) [L427] COND TRUE (int )c_dr_st == 0 [L429] tmp___0 = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...