./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:46,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:46,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:46,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:46,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:46,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:46,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:46,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:46,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:46,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:46,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:46,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:46,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:46,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:46,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:46,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:46,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:46,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:46,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:46,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:46,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:46,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:46,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:46,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:46,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:46,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:46,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:46,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:46,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:46,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:46,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:46,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:46,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:46,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:46,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:46,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:46,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:46,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:46,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:46,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:46,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:46,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:00:46,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:46,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:46,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:46,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:46,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:46,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:46,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:46,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:46,259 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:46,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:46,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:46,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:46,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:46,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:46,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:46,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:46,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:46,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:46,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:46,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:46,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:46,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:46,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:46,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(G ! call(reach_error())) ) 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 -> 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 [2022-02-20 20:00:46,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:46,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:46,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:46,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:46,515 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:46,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2022-02-20 20:00:46,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f10b78a7/0d806ab04ca244b7a66e25ffa07f697e/FLAG422ba3df3 [2022-02-20 20:00:46,956 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:46,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2022-02-20 20:00:46,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f10b78a7/0d806ab04ca244b7a66e25ffa07f697e/FLAG422ba3df3 [2022-02-20 20:00:46,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f10b78a7/0d806ab04ca244b7a66e25ffa07f697e [2022-02-20 20:00:46,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:46,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:46,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:46,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:46,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:46,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:46" (1/1) ... [2022-02-20 20:00:46,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9acc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:46, skipping insertion in model container [2022-02-20 20:00:46,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:46" (1/1) ... [2022-02-20 20:00:47,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:47,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:47,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[911,924] [2022-02-20 20:00:47,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[8416,8429] [2022-02-20 20:00:47,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:47,344 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:47,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[911,924] [2022-02-20 20:00:47,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[8416,8429] [2022-02-20 20:00:47,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:47,422 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:47,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47 WrapperNode [2022-02-20 20:00:47,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:47,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:47,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:47,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:47,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,510 INFO L137 Inliner]: procedures = 77, calls = 95, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1025 [2022-02-20 20:00:47,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:47,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:47,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:47,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:47,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:47,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:47,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:47,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:47,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (1/1) ... [2022-02-20 20:00:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:47,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:00:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:00:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:00:47,658 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:00:47,789 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:47,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:48,559 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:48,559 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:48,643 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:48,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:48,654 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 20:00:48,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:48 BoogieIcfgContainer [2022-02-20 20:00:48,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:48,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:48,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:48,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:48,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:46" (1/3) ... [2022-02-20 20:00:48,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18107e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:48, skipping insertion in model container [2022-02-20 20:00:48,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:47" (2/3) ... [2022-02-20 20:00:48,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18107e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:48, skipping insertion in model container [2022-02-20 20:00:48,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:48" (3/3) ... [2022-02-20 20:00:48,663 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c [2022-02-20 20:00:48,667 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:48,667 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:48,713 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:48,719 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:00:48,720 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 482 states, 421 states have (on average 1.6389548693586697) internal successors, (690), 429 states have internal predecessors, (690), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-02-20 20:00:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:48,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:48,758 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:48,758 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 42670934, now seen corresponding path program 1 times [2022-02-20 20:00:48,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:48,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318549770] [2022-02-20 20:00:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:49,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:49,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {487#(= ~q_read_ev~0 2)} #1862#return; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(= |old(~q_read_ev~0)| 0)} assume true; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528#(= |old(~q_read_ev~0)| 0)} {487#(= ~q_read_ev~0 2)} #1864#return; {486#false} is VALID [2022-02-20 20:00:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#true} havoc ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume 1 == ~p_dw_pc~0; {485#true} is VALID [2022-02-20 20:00:49,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {485#true} is VALID [2022-02-20 20:00:49,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} #res := ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,111 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {485#true} {485#true} #1858#return; {485#true} is VALID [2022-02-20 20:00:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#true} havoc ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume 1 == ~c_dr_pc~0; {485#true} is VALID [2022-02-20 20:00:49,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {485#true} is VALID [2022-02-20 20:00:49,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} #res := ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,119 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {485#true} {485#true} #1860#return; {485#true} is VALID [2022-02-20 20:00:49,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {485#true} is VALID [2022-02-20 20:00:49,120 INFO L272 TraceCheckUtils]: 1: Hoare triple {485#true} call #t~ret8 := is_do_write_p_triggered(); {485#true} is VALID [2022-02-20 20:00:49,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} havoc ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} assume 1 == ~p_dw_pc~0; {485#true} is VALID [2022-02-20 20:00:49,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {485#true} is VALID [2022-02-20 20:00:49,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} #res := ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,123 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {485#true} {485#true} #1858#return; {485#true} is VALID [2022-02-20 20:00:49,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {485#true} is VALID [2022-02-20 20:00:49,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {485#true} is VALID [2022-02-20 20:00:49,123 INFO L272 TraceCheckUtils]: 10: Hoare triple {485#true} call #t~ret9 := is_do_read_c_triggered(); {485#true} is VALID [2022-02-20 20:00:49,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {485#true} havoc ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#true} assume 1 == ~c_dr_pc~0; {485#true} is VALID [2022-02-20 20:00:49,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {485#true} is VALID [2022-02-20 20:00:49,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {485#true} #res := ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {485#true} {485#true} #1860#return; {485#true} is VALID [2022-02-20 20:00:49,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {485#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {485#true} is VALID [2022-02-20 20:00:49,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {485#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {485#true} is VALID [2022-02-20 20:00:49,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,128 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {485#true} {486#false} #1866#return; {486#false} is VALID [2022-02-20 20:00:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {485#true} is VALID [2022-02-20 20:00:49,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {485#true} is VALID [2022-02-20 20:00:49,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {486#false} #1868#return; {486#false} is VALID [2022-02-20 20:00:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#true} havoc ~__retres1~2; {485#true} is VALID [2022-02-20 20:00:49,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {485#true} is VALID [2022-02-20 20:00:49,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} #res := ~__retres1~2; {485#true} is VALID [2022-02-20 20:00:49,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,152 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #1870#return; {486#false} is VALID [2022-02-20 20:00:49,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {485#true} is VALID [2022-02-20 20:00:49,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {485#true} is VALID [2022-02-20 20:00:49,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#(= ~q_read_ev~0 2)} call update_channels1(); {525#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:49,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:49,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:49,158 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {526#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {487#(= ~q_read_ev~0 2)} #1862#return; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {487#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {487#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:49,160 INFO L272 TraceCheckUtils]: 12: Hoare triple {487#(= ~q_read_ev~0 2)} call fire_delta_events1(); {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:49,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(= |old(~q_read_ev~0)| 0)} assume true; {528#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:49,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {528#(= |old(~q_read_ev~0)| 0)} {487#(= ~q_read_ev~0 2)} #1864#return; {486#false} is VALID [2022-02-20 20:00:49,162 INFO L272 TraceCheckUtils]: 17: Hoare triple {486#false} call activate_threads1(); {529#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:49,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {529#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {485#true} is VALID [2022-02-20 20:00:49,163 INFO L272 TraceCheckUtils]: 19: Hoare triple {485#true} call #t~ret8 := is_do_write_p_triggered(); {485#true} is VALID [2022-02-20 20:00:49,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#true} havoc ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {485#true} assume 1 == ~p_dw_pc~0; {485#true} is VALID [2022-02-20 20:00:49,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {485#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {485#true} is VALID [2022-02-20 20:00:49,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {485#true} #res := ~__retres1~0; {485#true} is VALID [2022-02-20 20:00:49,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,164 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {485#true} {485#true} #1858#return; {485#true} is VALID [2022-02-20 20:00:49,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {485#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {485#true} is VALID [2022-02-20 20:00:49,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {485#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {485#true} is VALID [2022-02-20 20:00:49,164 INFO L272 TraceCheckUtils]: 28: Hoare triple {485#true} call #t~ret9 := is_do_read_c_triggered(); {485#true} is VALID [2022-02-20 20:00:49,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {485#true} havoc ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {485#true} assume 1 == ~c_dr_pc~0; {485#true} is VALID [2022-02-20 20:00:49,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {485#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {485#true} is VALID [2022-02-20 20:00:49,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {485#true} #res := ~__retres1~1; {485#true} is VALID [2022-02-20 20:00:49,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,166 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {485#true} {485#true} #1860#return; {485#true} is VALID [2022-02-20 20:00:49,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {485#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {485#true} is VALID [2022-02-20 20:00:49,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {485#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {485#true} is VALID [2022-02-20 20:00:49,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,166 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {485#true} {486#false} #1866#return; {486#false} is VALID [2022-02-20 20:00:49,166 INFO L272 TraceCheckUtils]: 39: Hoare triple {486#false} call reset_delta_events1(); {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:49,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {527#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {485#true} is VALID [2022-02-20 20:00:49,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {485#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {485#true} is VALID [2022-02-20 20:00:49,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,167 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {485#true} {486#false} #1868#return; {486#false} is VALID [2022-02-20 20:00:49,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-02-20 20:00:49,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {486#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {486#false} is VALID [2022-02-20 20:00:49,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-02-20 20:00:49,168 INFO L272 TraceCheckUtils]: 47: Hoare triple {486#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {485#true} is VALID [2022-02-20 20:00:49,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {485#true} havoc ~__retres1~2; {485#true} is VALID [2022-02-20 20:00:49,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {485#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {485#true} is VALID [2022-02-20 20:00:49,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {485#true} #res := ~__retres1~2; {485#true} is VALID [2022-02-20 20:00:49,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 20:00:49,171 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {485#true} {486#false} #1870#return; {486#false} is VALID [2022-02-20 20:00:49,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {486#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {486#false} is VALID [2022-02-20 20:00:49,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {486#false} assume 0 != eval1_~tmp___1~0#1; {486#false} is VALID [2022-02-20 20:00:49,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {486#false} assume !(0 == ~p_dw_st~0); {486#false} is VALID [2022-02-20 20:00:49,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {486#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {486#false} is VALID [2022-02-20 20:00:49,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {486#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {486#false} is VALID [2022-02-20 20:00:49,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {486#false} assume !(0 == ~c_dr_pc~0); {486#false} is VALID [2022-02-20 20:00:49,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {486#false} assume 2 == ~c_dr_pc~0; {486#false} is VALID [2022-02-20 20:00:49,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {486#false} do_read_c_~a~0#1 := ~a_t~0; {486#false} is VALID [2022-02-20 20:00:49,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {486#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {486#false} is VALID [2022-02-20 20:00:49,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {486#false} assume !(~p_last_write~0 == ~c_last_read~0); {486#false} is VALID [2022-02-20 20:00:49,183 INFO L272 TraceCheckUtils]: 63: Hoare triple {486#false} call error1(); {486#false} is VALID [2022-02-20 20:00:49,184 INFO L290 TraceCheckUtils]: 64: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-02-20 20:00:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:49,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:49,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318549770] [2022-02-20 20:00:49,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318549770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:49,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:49,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:49,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944152680] [2022-02-20 20:00:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:49,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:49,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:49,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:49,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:49,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:49,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:49,271 INFO L87 Difference]: Start difference. First operand has 482 states, 421 states have (on average 1.6389548693586697) internal successors, (690), 429 states have internal predecessors, (690), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,413 INFO L93 Difference]: Finished difference Result 1087 states and 1741 transitions. [2022-02-20 20:00:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1741 transitions. [2022-02-20 20:00:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1741 transitions. [2022-02-20 20:00:52,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1741 transitions. [2022-02-20 20:00:53,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1741 edges. 1741 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,635 INFO L225 Difference]: With dead ends: 1087 [2022-02-20 20:00:53,635 INFO L226 Difference]: Without dead ends: 622 [2022-02-20 20:00:53,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:53,642 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 1220 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:53,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1227 Valid, 2129 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-02-20 20:00:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 583. [2022-02-20 20:00:53,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:53,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:53,690 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:53,692 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:53,714 INFO L93 Difference]: Finished difference Result 622 states and 938 transitions. [2022-02-20 20:00:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 938 transitions. [2022-02-20 20:00:53,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:53,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:53,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) Second operand 622 states. [2022-02-20 20:00:53,721 INFO L87 Difference]: Start difference. First operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) Second operand 622 states. [2022-02-20 20:00:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:53,743 INFO L93 Difference]: Finished difference Result 622 states and 938 transitions. [2022-02-20 20:00:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 938 transitions. [2022-02-20 20:00:53,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:53,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:53,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:53,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 503 states have (on average 1.52882703777336) internal successors, (769), 510 states have internal predecessors, (769), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 882 transitions. [2022-02-20 20:00:53,770 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 882 transitions. Word has length 65 [2022-02-20 20:00:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:53,770 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 882 transitions. [2022-02-20 20:00:53,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 882 transitions. [2022-02-20 20:00:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:53,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:53,772 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:53,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:53,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1721559574, now seen corresponding path program 1 times [2022-02-20 20:00:53,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:53,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267675334] [2022-02-20 20:00:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {4050#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4012#(= ~q_write_ev~0 ~q_read_ev~0)} #1862#return; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {4052#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4052#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4012#(= ~q_write_ev~0 ~q_read_ev~0)} #1864#return; {4011#false} is VALID [2022-02-20 20:00:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {4010#true} havoc ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {4010#true} assume 1 == ~p_dw_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {4010#true} #res := ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4010#true} {4010#true} #1858#return; {4010#true} is VALID [2022-02-20 20:00:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {4010#true} havoc ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {4010#true} assume 1 == ~c_dr_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {4010#true} is VALID [2022-02-20 20:00:53,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {4010#true} #res := ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4010#true} {4010#true} #1860#return; {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {4054#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L272 TraceCheckUtils]: 1: Hoare triple {4010#true} call #t~ret8 := is_do_write_p_triggered(); {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} havoc ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {4010#true} assume 1 == ~p_dw_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {4010#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {4010#true} #res := ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4010#true} {4010#true} #1858#return; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {4010#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {4010#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4010#true} is VALID [2022-02-20 20:00:53,886 INFO L272 TraceCheckUtils]: 10: Hoare triple {4010#true} call #t~ret9 := is_do_read_c_triggered(); {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {4010#true} havoc ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {4010#true} assume 1 == ~c_dr_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {4010#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {4010#true} #res := ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4010#true} {4010#true} #1860#return; {4010#true} is VALID [2022-02-20 20:00:53,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {4010#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4010#true} is VALID [2022-02-20 20:00:53,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {4010#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4010#true} is VALID [2022-02-20 20:00:53,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,888 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4010#true} {4011#false} #1866#return; {4011#false} is VALID [2022-02-20 20:00:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {4010#true} is VALID [2022-02-20 20:00:53,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {4010#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4010#true} is VALID [2022-02-20 20:00:53,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4010#true} {4011#false} #1868#return; {4011#false} is VALID [2022-02-20 20:00:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {4010#true} havoc ~__retres1~2; {4010#true} is VALID [2022-02-20 20:00:53,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {4010#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4010#true} is VALID [2022-02-20 20:00:53,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} #res := ~__retres1~2; {4010#true} is VALID [2022-02-20 20:00:53,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,896 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4010#true} {4011#false} #1870#return; {4011#false} is VALID [2022-02-20 20:00:53,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {4010#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {4010#true} is VALID [2022-02-20 20:00:53,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {4010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {4010#true} is VALID [2022-02-20 20:00:53,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {4010#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {4050#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:53,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {4050#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,899 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4012#(= ~q_write_ev~0 ~q_read_ev~0)} #1862#return; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {4012#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:53,900 INFO L272 TraceCheckUtils]: 12: Hoare triple {4012#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {4052#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {4052#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:53,902 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4053#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4012#(= ~q_write_ev~0 ~q_read_ev~0)} #1864#return; {4011#false} is VALID [2022-02-20 20:00:53,902 INFO L272 TraceCheckUtils]: 17: Hoare triple {4011#false} call activate_threads1(); {4054#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:53,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {4054#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {4010#true} is VALID [2022-02-20 20:00:53,902 INFO L272 TraceCheckUtils]: 19: Hoare triple {4010#true} call #t~ret8 := is_do_write_p_triggered(); {4010#true} is VALID [2022-02-20 20:00:53,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#true} havoc ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {4010#true} assume 1 == ~p_dw_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {4010#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {4010#true} is VALID [2022-02-20 20:00:53,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {4010#true} #res := ~__retres1~0; {4010#true} is VALID [2022-02-20 20:00:53,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,903 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4010#true} {4010#true} #1858#return; {4010#true} is VALID [2022-02-20 20:00:53,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {4010#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4010#true} is VALID [2022-02-20 20:00:53,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {4010#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4010#true} is VALID [2022-02-20 20:00:53,907 INFO L272 TraceCheckUtils]: 28: Hoare triple {4010#true} call #t~ret9 := is_do_read_c_triggered(); {4010#true} is VALID [2022-02-20 20:00:53,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {4010#true} havoc ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {4010#true} assume 1 == ~c_dr_pc~0; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {4010#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {4010#true} #res := ~__retres1~1; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4010#true} {4010#true} #1860#return; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {4010#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {4010#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4010#true} is VALID [2022-02-20 20:00:53,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,909 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4010#true} {4011#false} #1866#return; {4011#false} is VALID [2022-02-20 20:00:53,909 INFO L272 TraceCheckUtils]: 39: Hoare triple {4011#false} call reset_delta_events1(); {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:53,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {4051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {4010#true} is VALID [2022-02-20 20:00:53,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {4010#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4010#true} is VALID [2022-02-20 20:00:53,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,909 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4010#true} {4011#false} #1868#return; {4011#false} is VALID [2022-02-20 20:00:53,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {4011#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {4011#false} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2022-02-20 20:00:53,910 INFO L272 TraceCheckUtils]: 47: Hoare triple {4011#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4010#true} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {4010#true} havoc ~__retres1~2; {4010#true} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {4010#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4010#true} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {4010#true} #res := ~__retres1~2; {4010#true} is VALID [2022-02-20 20:00:53,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {4010#true} assume true; {4010#true} is VALID [2022-02-20 20:00:53,910 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4010#true} {4011#false} #1870#return; {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {4011#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {4011#false} assume 0 != eval1_~tmp___1~0#1; {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {4011#false} assume !(0 == ~p_dw_st~0); {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {4011#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {4011#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {4011#false} assume !(0 == ~c_dr_pc~0); {4011#false} is VALID [2022-02-20 20:00:53,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {4011#false} assume 2 == ~c_dr_pc~0; {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {4011#false} do_read_c_~a~0#1 := ~a_t~0; {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {4011#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {4011#false} assume !(~p_last_write~0 == ~c_last_read~0); {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L272 TraceCheckUtils]: 63: Hoare triple {4011#false} call error1(); {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2022-02-20 20:00:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:53,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:53,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267675334] [2022-02-20 20:00:53,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267675334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:53,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:53,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:53,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464096364] [2022-02-20 20:00:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:53,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:53,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:53,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:53,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:53,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:53,950 INFO L87 Difference]: Start difference. First operand 583 states and 882 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:57,682 INFO L93 Difference]: Finished difference Result 980 states and 1448 transitions. [2022-02-20 20:00:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1124 transitions. [2022-02-20 20:00:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1124 transitions. [2022-02-20 20:00:57,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1124 transitions. [2022-02-20 20:00:58,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1124 edges. 1124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:58,491 INFO L225 Difference]: With dead ends: 980 [2022-02-20 20:00:58,492 INFO L226 Difference]: Without dead ends: 771 [2022-02-20 20:00:58,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:58,493 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 1394 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:58,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1426 Valid, 2824 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:00:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-02-20 20:00:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 695. [2022-02-20 20:00:58,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:58,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 771 states. Second operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:00:58,519 INFO L74 IsIncluded]: Start isIncluded. First operand 771 states. Second operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:00:58,521 INFO L87 Difference]: Start difference. First operand 771 states. Second operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:00:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,549 INFO L93 Difference]: Finished difference Result 771 states and 1156 transitions. [2022-02-20 20:00:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1156 transitions. [2022-02-20 20:00:58,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) Second operand 771 states. [2022-02-20 20:00:58,553 INFO L87 Difference]: Start difference. First operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) Second operand 771 states. [2022-02-20 20:00:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,578 INFO L93 Difference]: Finished difference Result 771 states and 1156 transitions. [2022-02-20 20:00:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1156 transitions. [2022-02-20 20:00:58,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:58,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 593 states have (on average 1.5092748735244519) internal successors, (895), 602 states have internal predecessors, (895), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:00:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1042 transitions. [2022-02-20 20:00:58,638 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1042 transitions. Word has length 65 [2022-02-20 20:00:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:58,639 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 1042 transitions. [2022-02-20 20:00:58,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1042 transitions. [2022-02-20 20:00:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:58,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:58,642 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:58,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:58,642 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -307026536, now seen corresponding path program 1 times [2022-02-20 20:00:58,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:58,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224772702] [2022-02-20 20:00:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {7901#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:58,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {7902#(not (= |old(~q_req_up~0)| 1))} assume true; {7902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:58,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7902#(not (= |old(~q_req_up~0)| 1))} {7862#(= ~q_req_up~0 ~p_dw_pc~0)} #1862#return; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#true} assume !(0 == ~q_write_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7859#true} {7866#(not (= ~p_dw_pc~0 1))} #1864#return; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {7859#true} havoc ~__retres1~0; {7859#true} is VALID [2022-02-20 20:00:58,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#true} assume 1 == ~p_dw_pc~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,764 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} {7859#true} #1858#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {7859#true} havoc ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#true} assume 1 == ~c_dr_pc~0; {7859#true} is VALID [2022-02-20 20:00:58,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {7859#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7859#true} is VALID [2022-02-20 20:00:58,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {7859#true} #res := ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,769 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7859#true} {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #1860#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {7904#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7859#true} is VALID [2022-02-20 20:00:58,770 INFO L272 TraceCheckUtils]: 1: Hoare triple {7859#true} call #t~ret8 := is_do_write_p_triggered(); {7859#true} is VALID [2022-02-20 20:00:58,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {7859#true} havoc ~__retres1~0; {7859#true} is VALID [2022-02-20 20:00:58,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {7859#true} assume 1 == ~p_dw_pc~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,771 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} {7859#true} #1858#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,772 INFO L272 TraceCheckUtils]: 10: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7859#true} is VALID [2022-02-20 20:00:58,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {7859#true} havoc ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {7859#true} assume 1 == ~c_dr_pc~0; {7859#true} is VALID [2022-02-20 20:00:58,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {7859#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7859#true} is VALID [2022-02-20 20:00:58,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {7859#true} #res := ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,773 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7859#true} {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #1860#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,775 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} {7866#(not (= ~p_dw_pc~0 1))} #1866#return; {7860#false} is VALID [2022-02-20 20:00:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7859#true} is VALID [2022-02-20 20:00:58,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7859#true} {7860#false} #1868#return; {7860#false} is VALID [2022-02-20 20:00:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {7859#true} havoc ~__retres1~2; {7859#true} is VALID [2022-02-20 20:00:58,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7859#true} is VALID [2022-02-20 20:00:58,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {7859#true} #res := ~__retres1~2; {7859#true} is VALID [2022-02-20 20:00:58,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,783 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7859#true} {7860#false} #1870#return; {7860#false} is VALID [2022-02-20 20:00:58,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {7859#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {7861#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:58,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {7861#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {7861#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:58,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {7861#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {7862#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:58,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {7862#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {7862#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:58,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {7862#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {7901#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:58,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {7901#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:58,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {7902#(not (= |old(~q_req_up~0)| 1))} assume true; {7902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:58,786 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7902#(not (= |old(~q_req_up~0)| 1))} {7862#(= ~q_req_up~0 ~p_dw_pc~0)} #1862#return; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:58,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {7859#true} assume !(0 == ~q_write_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,788 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7859#true} {7866#(not (= ~p_dw_pc~0 1))} #1864#return; {7866#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:58,789 INFO L272 TraceCheckUtils]: 17: Hoare triple {7866#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {7904#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:58,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {7904#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7859#true} is VALID [2022-02-20 20:00:58,789 INFO L272 TraceCheckUtils]: 19: Hoare triple {7859#true} call #t~ret8 := is_do_write_p_triggered(); {7859#true} is VALID [2022-02-20 20:00:58,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {7859#true} havoc ~__retres1~0; {7859#true} is VALID [2022-02-20 20:00:58,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {7859#true} assume 1 == ~p_dw_pc~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,791 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} {7859#true} #1858#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,792 INFO L272 TraceCheckUtils]: 28: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7859#true} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {7859#true} havoc ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {7859#true} assume 1 == ~c_dr_pc~0; {7859#true} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {7859#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7859#true} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {7859#true} #res := ~__retres1~1; {7859#true} is VALID [2022-02-20 20:00:58,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,793 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7859#true} {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} #1860#return; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:58,794 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7911#(= (+ (- 1) ~p_dw_pc~0) 0)} {7866#(not (= ~p_dw_pc~0 1))} #1866#return; {7860#false} is VALID [2022-02-20 20:00:58,794 INFO L272 TraceCheckUtils]: 39: Hoare triple {7860#false} call reset_delta_events1(); {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:58,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {7903#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7859#true} is VALID [2022-02-20 20:00:58,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {7859#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7859#true} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,795 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7859#true} {7860#false} #1868#return; {7860#false} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {7860#false} assume !false; {7860#false} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {7860#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {7860#false} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {7860#false} assume !false; {7860#false} is VALID [2022-02-20 20:00:58,795 INFO L272 TraceCheckUtils]: 47: Hoare triple {7860#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7859#true} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {7859#true} havoc ~__retres1~2; {7859#true} is VALID [2022-02-20 20:00:58,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {7859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7859#true} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {7859#true} #res := ~__retres1~2; {7859#true} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {7859#true} assume true; {7859#true} is VALID [2022-02-20 20:00:58,796 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7859#true} {7860#false} #1870#return; {7860#false} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {7860#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7860#false} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {7860#false} assume 0 != eval1_~tmp___1~0#1; {7860#false} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {7860#false} assume !(0 == ~p_dw_st~0); {7860#false} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {7860#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {7860#false} is VALID [2022-02-20 20:00:58,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {7860#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {7860#false} assume !(0 == ~c_dr_pc~0); {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {7860#false} assume 2 == ~c_dr_pc~0; {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {7860#false} do_read_c_~a~0#1 := ~a_t~0; {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {7860#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {7860#false} assume !(~p_last_write~0 == ~c_last_read~0); {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L272 TraceCheckUtils]: 63: Hoare triple {7860#false} call error1(); {7860#false} is VALID [2022-02-20 20:00:58,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {7860#false} assume !false; {7860#false} is VALID [2022-02-20 20:00:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:58,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:58,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224772702] [2022-02-20 20:00:58,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224772702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:58,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:58,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:58,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934008521] [2022-02-20 20:00:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:58,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:58,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:58,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:58,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:58,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:58,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:58,838 INFO L87 Difference]: Start difference. First operand 695 states and 1042 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,111 INFO L93 Difference]: Finished difference Result 2241 states and 3240 transitions. [2022-02-20 20:01:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:01:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1529 transitions. [2022-02-20 20:01:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1529 transitions. [2022-02-20 20:01:05,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1529 transitions. [2022-02-20 20:01:06,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1529 edges. 1529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:06,303 INFO L225 Difference]: With dead ends: 2241 [2022-02-20 20:01:06,303 INFO L226 Difference]: Without dead ends: 1908 [2022-02-20 20:01:06,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:06,306 INFO L933 BasicCegarLoop]: 855 mSDtfsCounter, 3705 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3723 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:06,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3723 Valid, 3164 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 20:01:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2022-02-20 20:01:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1748. [2022-02-20 20:01:06,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:06,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1908 states. Second operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:06,366 INFO L74 IsIncluded]: Start isIncluded. First operand 1908 states. Second operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:06,369 INFO L87 Difference]: Start difference. First operand 1908 states. Second operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:06,484 INFO L93 Difference]: Finished difference Result 1908 states and 2641 transitions. [2022-02-20 20:01:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2641 transitions. [2022-02-20 20:01:06,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:06,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:06,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) Second operand 1908 states. [2022-02-20 20:01:06,494 INFO L87 Difference]: Start difference. First operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) Second operand 1908 states. [2022-02-20 20:01:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:06,610 INFO L93 Difference]: Finished difference Result 1908 states and 2641 transitions. [2022-02-20 20:01:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2641 transitions. [2022-02-20 20:01:06,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:06,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:06,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:06,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1441 states have (on average 1.4149895905621097) internal successors, (2039), 1465 states have internal predecessors, (2039), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2429 transitions. [2022-02-20 20:01:06,757 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2429 transitions. Word has length 65 [2022-02-20 20:01:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:06,757 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2429 transitions. [2022-02-20 20:01:06,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2429 transitions. [2022-02-20 20:01:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:06,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:06,759 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:06,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:01:06,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1016929551, now seen corresponding path program 1 times [2022-02-20 20:01:06,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:06,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986150525] [2022-02-20 20:01:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {17191#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {17151#true} is VALID [2022-02-20 20:01:06,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17151#true} {17151#true} #1862#return; {17151#true} is VALID [2022-02-20 20:01:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume !(0 == ~q_write_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17151#true} {17151#true} #1864#return; {17151#true} is VALID [2022-02-20 20:01:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {17151#true} havoc ~__retres1~0; {17151#true} is VALID [2022-02-20 20:01:06,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume !(1 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} assume !(2 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {17151#true} ~__retres1~0 := 0; {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:06,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,897 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17151#true} #1858#return; {17201#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {17151#true} havoc ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume 1 == ~c_dr_pc~0; {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {17151#true} #res := ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17151#true} {17152#false} #1860#return; {17152#false} is VALID [2022-02-20 20:01:06,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {17193#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L272 TraceCheckUtils]: 1: Hoare triple {17151#true} call #t~ret8 := is_do_write_p_triggered(); {17151#true} is VALID [2022-02-20 20:01:06,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} havoc ~__retres1~0; {17151#true} is VALID [2022-02-20 20:01:06,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {17151#true} assume !(1 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {17151#true} assume !(2 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {17151#true} ~__retres1~0 := 0; {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:06,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,903 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17151#true} #1858#return; {17201#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:06,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {17201#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17202#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:06,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {17202#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17152#false} is VALID [2022-02-20 20:01:06,906 INFO L272 TraceCheckUtils]: 11: Hoare triple {17152#false} call #t~ret9 := is_do_read_c_triggered(); {17151#true} is VALID [2022-02-20 20:01:06,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {17151#true} havoc ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {17151#true} assume 1 == ~c_dr_pc~0; {17151#true} is VALID [2022-02-20 20:01:06,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {17151#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17151#true} is VALID [2022-02-20 20:01:06,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {17151#true} #res := ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,910 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17151#true} {17152#false} #1860#return; {17152#false} is VALID [2022-02-20 20:01:06,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {17152#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17152#false} is VALID [2022-02-20 20:01:06,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {17152#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {17152#false} is VALID [2022-02-20 20:01:06,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {17152#false} assume true; {17152#false} is VALID [2022-02-20 20:01:06,913 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17152#false} {17151#true} #1866#return; {17152#false} is VALID [2022-02-20 20:01:06,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17151#true} is VALID [2022-02-20 20:01:06,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17151#true} {17152#false} #1868#return; {17152#false} is VALID [2022-02-20 20:01:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:06,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {17151#true} havoc ~__retres1~2; {17151#true} is VALID [2022-02-20 20:01:06,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17151#true} is VALID [2022-02-20 20:01:06,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} #res := ~__retres1~2; {17151#true} is VALID [2022-02-20 20:01:06,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,926 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17151#true} {17152#false} #1870#return; {17152#false} is VALID [2022-02-20 20:01:06,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {17151#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {17151#true} is VALID [2022-02-20 20:01:06,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {17151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {17151#true} is VALID [2022-02-20 20:01:06,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {17151#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {17151#true} is VALID [2022-02-20 20:01:06,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {17151#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {17151#true} call update_channels1(); {17191#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:06,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {17191#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17151#true} {17151#true} #1862#return; {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {17151#true} assume { :begin_inline_init_threads1 } true; {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {17151#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17151#true} is VALID [2022-02-20 20:01:06,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {17151#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17151#true} is VALID [2022-02-20 20:01:06,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {17151#true} assume { :end_inline_init_threads1 } true; {17151#true} is VALID [2022-02-20 20:01:06,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {17151#true} call fire_delta_events1(); {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:06,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {17151#true} assume !(0 == ~q_write_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,930 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17151#true} {17151#true} #1864#return; {17151#true} is VALID [2022-02-20 20:01:06,931 INFO L272 TraceCheckUtils]: 17: Hoare triple {17151#true} call activate_threads1(); {17193#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:06,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {17193#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {17151#true} is VALID [2022-02-20 20:01:06,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {17151#true} call #t~ret8 := is_do_write_p_triggered(); {17151#true} is VALID [2022-02-20 20:01:06,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {17151#true} havoc ~__retres1~0; {17151#true} is VALID [2022-02-20 20:01:06,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {17151#true} assume !(1 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {17151#true} assume !(2 == ~p_dw_pc~0); {17151#true} is VALID [2022-02-20 20:01:06,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {17151#true} ~__retres1~0 := 0; {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:06,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {17209#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:06,933 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17210#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17151#true} #1858#return; {17201#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:06,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {17201#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17202#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {17202#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17152#false} is VALID [2022-02-20 20:01:06,934 INFO L272 TraceCheckUtils]: 29: Hoare triple {17152#false} call #t~ret9 := is_do_read_c_triggered(); {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {17151#true} havoc ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {17151#true} assume 1 == ~c_dr_pc~0; {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {17151#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {17151#true} #res := ~__retres1~1; {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,934 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17151#true} {17152#false} #1860#return; {17152#false} is VALID [2022-02-20 20:01:06,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {17152#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17152#false} is VALID [2022-02-20 20:01:06,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {17152#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {17152#false} is VALID [2022-02-20 20:01:06,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {17152#false} assume true; {17152#false} is VALID [2022-02-20 20:01:06,935 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17152#false} {17151#true} #1866#return; {17152#false} is VALID [2022-02-20 20:01:06,935 INFO L272 TraceCheckUtils]: 40: Hoare triple {17152#false} call reset_delta_events1(); {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:06,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {17192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {17151#true} is VALID [2022-02-20 20:01:06,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {17151#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17151#true} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,936 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17151#true} {17152#false} #1868#return; {17152#false} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {17152#false} assume !false; {17152#false} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {17152#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {17152#false} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {17152#false} assume !false; {17152#false} is VALID [2022-02-20 20:01:06,936 INFO L272 TraceCheckUtils]: 48: Hoare triple {17152#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17151#true} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {17151#true} havoc ~__retres1~2; {17151#true} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {17151#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17151#true} is VALID [2022-02-20 20:01:06,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {17151#true} #res := ~__retres1~2; {17151#true} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {17151#true} assume true; {17151#true} is VALID [2022-02-20 20:01:06,937 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17151#true} {17152#false} #1870#return; {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {17152#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {17152#false} assume 0 != eval1_~tmp___1~0#1; {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {17152#false} assume !(0 == ~p_dw_st~0); {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {17152#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {17152#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {17152#false} assume !(0 == ~c_dr_pc~0); {17152#false} is VALID [2022-02-20 20:01:06,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {17152#false} assume 2 == ~c_dr_pc~0; {17152#false} is VALID [2022-02-20 20:01:06,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {17152#false} do_read_c_~a~0#1 := ~a_t~0; {17152#false} is VALID [2022-02-20 20:01:06,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {17152#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {17152#false} is VALID [2022-02-20 20:01:06,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {17152#false} assume !(~p_last_write~0 == ~c_last_read~0); {17152#false} is VALID [2022-02-20 20:01:06,938 INFO L272 TraceCheckUtils]: 64: Hoare triple {17152#false} call error1(); {17152#false} is VALID [2022-02-20 20:01:06,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {17152#false} assume !false; {17152#false} is VALID [2022-02-20 20:01:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:06,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:06,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986150525] [2022-02-20 20:01:06,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986150525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:06,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:06,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:06,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791887790] [2022-02-20 20:01:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:06,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:01:06,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:06,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:06,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:06,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:06,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:06,975 INFO L87 Difference]: Start difference. First operand 1748 states and 2429 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:10,831 INFO L93 Difference]: Finished difference Result 3276 states and 4508 transitions. [2022-02-20 20:01:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:01:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 905 transitions. [2022-02-20 20:01:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 905 transitions. [2022-02-20 20:01:10,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 905 transitions. [2022-02-20 20:01:11,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 905 edges. 905 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:11,535 INFO L225 Difference]: With dead ends: 3276 [2022-02-20 20:01:11,535 INFO L226 Difference]: Without dead ends: 1896 [2022-02-20 20:01:11,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:01:11,545 INFO L933 BasicCegarLoop]: 712 mSDtfsCounter, 935 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:11,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 2860 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-02-20 20:01:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1788. [2022-02-20 20:01:11,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1896 states. Second operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:11,633 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:11,636 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:11,746 INFO L93 Difference]: Finished difference Result 1896 states and 2617 transitions. [2022-02-20 20:01:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2617 transitions. [2022-02-20 20:01:11,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:11,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:11,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) Second operand 1896 states. [2022-02-20 20:01:11,757 INFO L87 Difference]: Start difference. First operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) Second operand 1896 states. [2022-02-20 20:01:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:11,873 INFO L93 Difference]: Finished difference Result 1896 states and 2617 transitions. [2022-02-20 20:01:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2617 transitions. [2022-02-20 20:01:11,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:11,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:11,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:11,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1473 states have (on average 1.4019008825526138) internal successors, (2065), 1497 states have internal predecessors, (2065), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2463 transitions. [2022-02-20 20:01:12,022 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2463 transitions. Word has length 66 [2022-02-20 20:01:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:12,023 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 2463 transitions. [2022-02-20 20:01:12,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2463 transitions. [2022-02-20 20:01:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:12,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:12,024 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:12,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:12,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:12,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2046288849, now seen corresponding path program 1 times [2022-02-20 20:01:12,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:12,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850270493] [2022-02-20 20:01:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {27837#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27838#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:12,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {27838#(not (= |old(~q_req_up~0)| 1))} assume true; {27838#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:12,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27838#(not (= |old(~q_req_up~0)| 1))} {27797#(= ~c_dr_pc~0 ~q_req_up~0)} #1862#return; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {27794#true} assume !(0 == ~q_write_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27794#true} {27801#(not (= ~c_dr_pc~0 1))} #1864#return; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {27794#true} havoc ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {27794#true} assume !(1 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {27794#true} assume !(2 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {27794#true} ~__retres1~0 := 0; {27794#true} is VALID [2022-02-20 20:01:12,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {27794#true} #res := ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,115 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27794#true} {27794#true} #1858#return; {27794#true} is VALID [2022-02-20 20:01:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {27794#true} havoc ~__retres1~1; {27794#true} is VALID [2022-02-20 20:01:12,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {27794#true} assume 1 == ~c_dr_pc~0; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,121 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} {27794#true} #1860#return; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {27840#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L272 TraceCheckUtils]: 1: Hoare triple {27794#true} call #t~ret8 := is_do_write_p_triggered(); {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {27794#true} havoc ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {27794#true} assume !(1 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {27794#true} assume !(2 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {27794#true} ~__retres1~0 := 0; {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {27794#true} #res := ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,122 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27794#true} {27794#true} #1858#return; {27794#true} is VALID [2022-02-20 20:01:12,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {27794#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27794#true} is VALID [2022-02-20 20:01:12,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {27794#true} assume !(0 != ~tmp~1); {27794#true} is VALID [2022-02-20 20:01:12,123 INFO L272 TraceCheckUtils]: 11: Hoare triple {27794#true} call #t~ret9 := is_do_read_c_triggered(); {27794#true} is VALID [2022-02-20 20:01:12,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {27794#true} havoc ~__retres1~1; {27794#true} is VALID [2022-02-20 20:01:12,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {27794#true} assume 1 == ~c_dr_pc~0; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,124 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} {27794#true} #1860#return; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,126 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} {27801#(not (= ~c_dr_pc~0 1))} #1866#return; {27795#false} is VALID [2022-02-20 20:01:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {27794#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27794#true} is VALID [2022-02-20 20:01:12,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27794#true} {27795#false} #1868#return; {27795#false} is VALID [2022-02-20 20:01:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:12,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {27794#true} havoc ~__retres1~2; {27794#true} is VALID [2022-02-20 20:01:12,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {27794#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27794#true} is VALID [2022-02-20 20:01:12,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {27794#true} #res := ~__retres1~2; {27794#true} is VALID [2022-02-20 20:01:12,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,137 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27794#true} {27795#false} #1870#return; {27795#false} is VALID [2022-02-20 20:01:12,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {27794#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {27796#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:12,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {27796#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {27796#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:12,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {27796#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {27797#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:12,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {27797#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {27797#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:12,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {27797#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {27837#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:12,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {27837#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27838#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:12,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {27838#(not (= |old(~q_req_up~0)| 1))} assume true; {27838#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:12,139 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27838#(not (= |old(~q_req_up~0)| 1))} {27797#(= ~c_dr_pc~0 ~q_req_up~0)} #1862#return; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:12,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {27794#true} assume !(0 == ~q_write_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,157 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27794#true} {27801#(not (= ~c_dr_pc~0 1))} #1864#return; {27801#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:12,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {27801#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {27840#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:12,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {27840#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27794#true} is VALID [2022-02-20 20:01:12,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {27794#true} call #t~ret8 := is_do_write_p_triggered(); {27794#true} is VALID [2022-02-20 20:01:12,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {27794#true} havoc ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {27794#true} assume !(1 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {27794#true} assume !(2 == ~p_dw_pc~0); {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {27794#true} ~__retres1~0 := 0; {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {27794#true} #res := ~__retres1~0; {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27794#true} {27794#true} #1858#return; {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {27794#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {27794#true} assume !(0 != ~tmp~1); {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L272 TraceCheckUtils]: 29: Hoare triple {27794#true} call #t~ret9 := is_do_read_c_triggered(); {27794#true} is VALID [2022-02-20 20:01:12,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {27794#true} havoc ~__retres1~1; {27794#true} is VALID [2022-02-20 20:01:12,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {27794#true} assume 1 == ~c_dr_pc~0; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,160 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} {27794#true} #1860#return; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:12,161 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27854#(= (+ (- 1) ~c_dr_pc~0) 0)} {27801#(not (= ~c_dr_pc~0 1))} #1866#return; {27795#false} is VALID [2022-02-20 20:01:12,161 INFO L272 TraceCheckUtils]: 40: Hoare triple {27795#false} call reset_delta_events1(); {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:12,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {27839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27794#true} is VALID [2022-02-20 20:01:12,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {27794#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27794#true} is VALID [2022-02-20 20:01:12,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,161 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27794#true} {27795#false} #1868#return; {27795#false} is VALID [2022-02-20 20:01:12,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {27795#false} assume !false; {27795#false} is VALID [2022-02-20 20:01:12,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {27795#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {27795#false} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {27795#false} assume !false; {27795#false} is VALID [2022-02-20 20:01:12,162 INFO L272 TraceCheckUtils]: 48: Hoare triple {27795#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27794#true} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {27794#true} havoc ~__retres1~2; {27794#true} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {27794#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27794#true} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {27794#true} #res := ~__retres1~2; {27794#true} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {27794#true} assume true; {27794#true} is VALID [2022-02-20 20:01:12,162 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27794#true} {27795#false} #1870#return; {27795#false} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {27795#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {27795#false} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {27795#false} assume 0 != eval1_~tmp___1~0#1; {27795#false} is VALID [2022-02-20 20:01:12,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {27795#false} assume !(0 == ~p_dw_st~0); {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {27795#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {27795#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {27795#false} assume !(0 == ~c_dr_pc~0); {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {27795#false} assume 2 == ~c_dr_pc~0; {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {27795#false} do_read_c_~a~0#1 := ~a_t~0; {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {27795#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {27795#false} assume !(~p_last_write~0 == ~c_last_read~0); {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L272 TraceCheckUtils]: 64: Hoare triple {27795#false} call error1(); {27795#false} is VALID [2022-02-20 20:01:12,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {27795#false} assume !false; {27795#false} is VALID [2022-02-20 20:01:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:12,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:12,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850270493] [2022-02-20 20:01:12,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850270493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:12,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:12,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:12,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266400413] [2022-02-20 20:01:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:12,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:12,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:12,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:12,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:12,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:12,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:12,199 INFO L87 Difference]: Start difference. First operand 1788 states and 2463 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:19,326 INFO L93 Difference]: Finished difference Result 5360 states and 7337 transitions. [2022-02-20 20:01:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1518 transitions. [2022-02-20 20:01:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1518 transitions. [2022-02-20 20:01:19,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1518 transitions. [2022-02-20 20:01:20,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1518 edges. 1518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:20,575 INFO L225 Difference]: With dead ends: 5360 [2022-02-20 20:01:20,575 INFO L226 Difference]: Without dead ends: 2179 [2022-02-20 20:01:20,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:20,583 INFO L933 BasicCegarLoop]: 849 mSDtfsCounter, 4287 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:20,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4305 Valid, 2767 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:01:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2022-02-20 20:01:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1999. [2022-02-20 20:01:20,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:20,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2179 states. Second operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:20,670 INFO L74 IsIncluded]: Start isIncluded. First operand 2179 states. Second operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:20,672 INFO L87 Difference]: Start difference. First operand 2179 states. Second operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:20,817 INFO L93 Difference]: Finished difference Result 2179 states and 2906 transitions. [2022-02-20 20:01:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2906 transitions. [2022-02-20 20:01:20,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:20,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:20,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) Second operand 2179 states. [2022-02-20 20:01:20,829 INFO L87 Difference]: Start difference. First operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) Second operand 2179 states. [2022-02-20 20:01:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:20,969 INFO L93 Difference]: Finished difference Result 2179 states and 2906 transitions. [2022-02-20 20:01:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2906 transitions. [2022-02-20 20:01:20,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:20,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:20,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:20,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1612 states have (on average 1.3591811414392059) internal successors, (2191), 1638 states have internal predecessors, (2191), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2675 transitions. [2022-02-20 20:01:21,159 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2675 transitions. Word has length 66 [2022-02-20 20:01:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:21,159 INFO L470 AbstractCegarLoop]: Abstraction has 1999 states and 2675 transitions. [2022-02-20 20:01:21,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2675 transitions. [2022-02-20 20:01:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:21,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:21,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:21,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:21,161 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 630136045, now seen corresponding path program 1 times [2022-02-20 20:01:21,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:21,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656766589] [2022-02-20 20:01:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {42208#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {42162#true} is VALID [2022-02-20 20:01:21,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42162#true} {42162#true} #1862#return; {42162#true} is VALID [2022-02-20 20:01:21,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume !(0 == ~q_write_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42162#true} {42162#true} #1864#return; {42162#true} is VALID [2022-02-20 20:01:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {42162#true} havoc ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume !(1 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} assume !(2 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} ~__retres1~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {42162#true} #res := ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42162#true} {42162#true} #1858#return; {42162#true} is VALID [2022-02-20 20:01:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {42162#true} havoc ~__retres1~1; {42162#true} is VALID [2022-02-20 20:01:21,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume !(1 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} assume !(2 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} ~__retres1~1 := 0; {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:21,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,292 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42162#true} #1860#return; {42225#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:21,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {42210#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L272 TraceCheckUtils]: 1: Hoare triple {42162#true} call #t~ret8 := is_do_write_p_triggered(); {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} havoc ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} assume !(1 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {42162#true} assume !(2 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {42162#true} ~__retres1~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {42162#true} #res := ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {42162#true} {42162#true} #1858#return; {42162#true} is VALID [2022-02-20 20:01:21,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {42162#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {42162#true} assume !(0 != ~tmp~1); {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L272 TraceCheckUtils]: 11: Hoare triple {42162#true} call #t~ret9 := is_do_read_c_triggered(); {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {42162#true} havoc ~__retres1~1; {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {42162#true} assume !(1 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {42162#true} assume !(2 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {42162#true} ~__retres1~1 := 0; {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:21,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,295 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42162#true} #1860#return; {42225#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:21,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {42225#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42226#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:21,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {42226#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {42163#false} is VALID [2022-02-20 20:01:21,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {42163#false} assume true; {42163#false} is VALID [2022-02-20 20:01:21,296 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42163#false} {42162#true} #1866#return; {42163#false} is VALID [2022-02-20 20:01:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {42162#true} is VALID [2022-02-20 20:01:21,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42162#true} {42163#false} #1868#return; {42163#false} is VALID [2022-02-20 20:01:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {42162#true} havoc ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42162#true} is VALID [2022-02-20 20:01:21,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} #res := ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42162#true} {42163#false} #1870#return; {42163#false} is VALID [2022-02-20 20:01:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:21,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {42162#true} havoc ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} #res := ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42162#true} {42163#false} #1870#return; {42163#false} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {42162#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {42162#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {42162#true} is VALID [2022-02-20 20:01:21,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {42162#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {42162#true} is VALID [2022-02-20 20:01:21,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {42162#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {42162#true} is VALID [2022-02-20 20:01:21,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {42162#true} call update_channels1(); {42208#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:21,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {42208#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {42162#true} is VALID [2022-02-20 20:01:21,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,314 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42162#true} {42162#true} #1862#return; {42162#true} is VALID [2022-02-20 20:01:21,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {42162#true} assume { :begin_inline_init_threads1 } true; {42162#true} is VALID [2022-02-20 20:01:21,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {42162#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {42162#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {42162#true} assume { :end_inline_init_threads1 } true; {42162#true} is VALID [2022-02-20 20:01:21,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {42162#true} call fire_delta_events1(); {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:21,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {42162#true} assume !(0 == ~q_write_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42162#true} {42162#true} #1864#return; {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {42162#true} call activate_threads1(); {42210#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:21,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {42210#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {42162#true} call #t~ret8 := is_do_write_p_triggered(); {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {42162#true} havoc ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {42162#true} assume !(1 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {42162#true} assume !(2 == ~p_dw_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {42162#true} ~__retres1~0 := 0; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {42162#true} #res := ~__retres1~0; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42162#true} {42162#true} #1858#return; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {42162#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {42162#true} assume !(0 != ~tmp~1); {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L272 TraceCheckUtils]: 29: Hoare triple {42162#true} call #t~ret9 := is_do_read_c_triggered(); {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {42162#true} havoc ~__retres1~1; {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {42162#true} assume !(1 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {42162#true} assume !(2 == ~c_dr_pc~0); {42162#true} is VALID [2022-02-20 20:01:21,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {42162#true} ~__retres1~1 := 0; {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:21,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {42227#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:21,320 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {42228#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42162#true} #1860#return; {42225#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {42225#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42226#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {42226#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {42163#false} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {42163#false} assume true; {42163#false} is VALID [2022-02-20 20:01:21,321 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42163#false} {42162#true} #1866#return; {42163#false} is VALID [2022-02-20 20:01:21,321 INFO L272 TraceCheckUtils]: 41: Hoare triple {42163#false} call reset_delta_events1(); {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {42209#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {42162#true} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {42162#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {42162#true} is VALID [2022-02-20 20:01:21,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,321 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {42162#true} {42163#false} #1868#return; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {42163#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L272 TraceCheckUtils]: 49: Hoare triple {42163#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42162#true} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {42162#true} havoc ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {42162#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42162#true} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {42162#true} #res := ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,322 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {42162#true} {42163#false} #1870#return; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {42163#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {42163#false} assume 0 != eval1_~tmp___1~0#1; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {42163#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {42163#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {42163#false} is VALID [2022-02-20 20:01:21,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {42163#false} assume 0 == ~p_dw_pc~0; {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {42163#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {42163#false} assume { :end_inline_do_write_p } true; {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {42163#false} assume !(0 == ~c_dr_st~0); {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,323 INFO L272 TraceCheckUtils]: 65: Hoare triple {42163#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42162#true} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {42162#true} havoc ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {42162#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42162#true} is VALID [2022-02-20 20:01:21,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {42162#true} #res := ~__retres1~2; {42162#true} is VALID [2022-02-20 20:01:21,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {42162#true} assume true; {42162#true} is VALID [2022-02-20 20:01:21,324 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {42162#true} {42163#false} #1870#return; {42163#false} is VALID [2022-02-20 20:01:21,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {42163#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {42163#false} is VALID [2022-02-20 20:01:21,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {42163#false} assume 0 != eval1_~tmp___1~0#1; {42163#false} is VALID [2022-02-20 20:01:21,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {42163#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {42163#false} is VALID [2022-02-20 20:01:21,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {42163#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {42163#false} assume !(0 == ~p_dw_pc~0); {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {42163#false} assume 1 == ~p_dw_pc~0; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {42163#false} assume !(0 == ~q_free~0); {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {42163#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {42163#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {42163#false} assume { :end_inline_do_write_p } true; {42163#false} is VALID [2022-02-20 20:01:21,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {42163#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {42163#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {42163#false} assume !(0 == ~c_dr_pc~0); {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {42163#false} assume 2 == ~c_dr_pc~0; {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {42163#false} do_read_c_~a~0#1 := ~a_t~0; {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {42163#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {42163#false} assume !(~p_last_write~0 == ~c_last_read~0); {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L272 TraceCheckUtils]: 89: Hoare triple {42163#false} call error1(); {42163#false} is VALID [2022-02-20 20:01:21,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {42163#false} assume !false; {42163#false} is VALID [2022-02-20 20:01:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:21,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:21,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656766589] [2022-02-20 20:01:21,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656766589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:21,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:21,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:21,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851949263] [2022-02-20 20:01:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:21,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:21,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:21,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:21,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:21,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:21,373 INFO L87 Difference]: Start difference. First operand 1999 states and 2675 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:25,176 INFO L93 Difference]: Finished difference Result 3824 states and 5077 transitions. [2022-02-20 20:01:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 890 transitions. [2022-02-20 20:01:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 890 transitions. [2022-02-20 20:01:25,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 890 transitions. [2022-02-20 20:01:25,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 890 edges. 890 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:25,954 INFO L225 Difference]: With dead ends: 3824 [2022-02-20 20:01:25,954 INFO L226 Difference]: Without dead ends: 2193 [2022-02-20 20:01:25,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:25,957 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 929 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:25,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 2812 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2022-02-20 20:01:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2059. [2022-02-20 20:01:26,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:26,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2193 states. Second operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:26,059 INFO L74 IsIncluded]: Start isIncluded. First operand 2193 states. Second operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:26,061 INFO L87 Difference]: Start difference. First operand 2193 states. Second operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:26,202 INFO L93 Difference]: Finished difference Result 2193 states and 2918 transitions. [2022-02-20 20:01:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2918 transitions. [2022-02-20 20:01:26,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:26,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:26,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) Second operand 2193 states. [2022-02-20 20:01:26,211 INFO L87 Difference]: Start difference. First operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) Second operand 2193 states. [2022-02-20 20:01:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:26,354 INFO L93 Difference]: Finished difference Result 2193 states and 2918 transitions. [2022-02-20 20:01:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2918 transitions. [2022-02-20 20:01:26,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:26,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:26,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:26,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1660 states have (on average 1.3451807228915662) internal successors, (2233), 1686 states have internal predecessors, (2233), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2729 transitions. [2022-02-20 20:01:26,544 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2729 transitions. Word has length 91 [2022-02-20 20:01:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:26,544 INFO L470 AbstractCegarLoop]: Abstraction has 2059 states and 2729 transitions. [2022-02-20 20:01:26,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2729 transitions. [2022-02-20 20:01:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:26,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:26,549 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:26,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:26,549 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1074036719, now seen corresponding path program 1 times [2022-02-20 20:01:26,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:26,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888342316] [2022-02-20 20:01:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {54545#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1862#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1864#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {54498#true} havoc ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {54498#true} assume !(1 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} assume !(2 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {54498#true} ~__retres1~0 := 0; {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {54498#true} #res := ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {54498#true} {54498#true} #1858#return; {54498#true} is VALID [2022-02-20 20:01:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {54498#true} havoc ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {54498#true} assume !(1 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} assume !(2 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {54498#true} ~__retres1~1 := 0; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {54498#true} #res := ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {54498#true} {54498#true} #1860#return; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {54547#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L272 TraceCheckUtils]: 1: Hoare triple {54498#true} call #t~ret8 := is_do_write_p_triggered(); {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} havoc ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {54498#true} assume !(1 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {54498#true} assume !(2 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {54498#true} ~__retres1~0 := 0; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {54498#true} #res := ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {54498#true} {54498#true} #1858#return; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {54498#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54498#true} is VALID [2022-02-20 20:01:26,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {54498#true} assume !(0 != ~tmp~1); {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L272 TraceCheckUtils]: 11: Hoare triple {54498#true} call #t~ret9 := is_do_read_c_triggered(); {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {54498#true} havoc ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {54498#true} assume !(1 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {54498#true} assume !(2 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {54498#true} ~__retres1~1 := 0; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {54498#true} #res := ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {54498#true} {54498#true} #1860#return; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {54498#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {54498#true} assume !(0 != ~tmp___0~1); {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,647 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {54498#true} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1866#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {54562#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:26,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {54562#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:26,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:26,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1868#return; {54499#false} is VALID [2022-02-20 20:01:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {54498#true} havoc ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {54498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54498#true} is VALID [2022-02-20 20:01:26,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} #res := ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,690 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54498#true} {54499#false} #1870#return; {54499#false} is VALID [2022-02-20 20:01:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {54498#true} havoc ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {54498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54498#true} is VALID [2022-02-20 20:01:26,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} #res := ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,694 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54498#true} {54499#false} #1870#return; {54499#false} is VALID [2022-02-20 20:01:26,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {54498#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {54498#true} is VALID [2022-02-20 20:01:26,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {54498#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {54498#true} is VALID [2022-02-20 20:01:26,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {54498#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {54545#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:26,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {54545#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,697 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1862#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,698 INFO L272 TraceCheckUtils]: 12: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,706 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1864#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,707 INFO L272 TraceCheckUtils]: 17: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {54547#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:26,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {54547#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {54498#true} is VALID [2022-02-20 20:01:26,707 INFO L272 TraceCheckUtils]: 19: Hoare triple {54498#true} call #t~ret8 := is_do_write_p_triggered(); {54498#true} is VALID [2022-02-20 20:01:26,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {54498#true} havoc ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {54498#true} assume !(1 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {54498#true} assume !(2 == ~p_dw_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {54498#true} ~__retres1~0 := 0; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {54498#true} #res := ~__retres1~0; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {54498#true} {54498#true} #1858#return; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {54498#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {54498#true} assume !(0 != ~tmp~1); {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L272 TraceCheckUtils]: 29: Hoare triple {54498#true} call #t~ret9 := is_do_read_c_triggered(); {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {54498#true} havoc ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {54498#true} assume !(1 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {54498#true} assume !(2 == ~c_dr_pc~0); {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {54498#true} ~__retres1~1 := 0; {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {54498#true} #res := ~__retres1~1; {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54498#true} {54498#true} #1860#return; {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {54498#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {54498#true} assume !(0 != ~tmp___0~1); {54498#true} is VALID [2022-02-20 20:01:26,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,710 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {54498#true} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1866#return; {54500#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:26,710 INFO L272 TraceCheckUtils]: 41: Hoare triple {54500#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:26,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {54546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {54562#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:26,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {54562#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:26,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:26,712 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {54563#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {54500#(= ~q_write_ev~0 ~q_read_ev~0)} #1868#return; {54499#false} is VALID [2022-02-20 20:01:26,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {54499#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {54499#false} is VALID [2022-02-20 20:01:26,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,712 INFO L272 TraceCheckUtils]: 49: Hoare triple {54499#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54498#true} is VALID [2022-02-20 20:01:26,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {54498#true} havoc ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {54498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54498#true} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {54498#true} #res := ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,713 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {54498#true} {54499#false} #1870#return; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {54499#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {54499#false} assume 0 != eval1_~tmp___1~0#1; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {54499#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {54499#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {54499#false} assume 0 == ~p_dw_pc~0; {54499#false} is VALID [2022-02-20 20:01:26,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 61: Hoare triple {54499#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54499#false} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 62: Hoare triple {54499#false} assume { :end_inline_do_write_p } true; {54499#false} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {54499#false} assume !(0 == ~c_dr_st~0); {54499#false} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 64: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,714 INFO L272 TraceCheckUtils]: 65: Hoare triple {54499#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54498#true} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 66: Hoare triple {54498#true} havoc ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 67: Hoare triple {54498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54498#true} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {54498#true} #res := ~__retres1~2; {54498#true} is VALID [2022-02-20 20:01:26,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {54498#true} assume true; {54498#true} is VALID [2022-02-20 20:01:26,714 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {54498#true} {54499#false} #1870#return; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {54499#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {54499#false} assume 0 != eval1_~tmp___1~0#1; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {54499#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {54499#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {54499#false} assume !(0 == ~p_dw_pc~0); {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {54499#false} assume 1 == ~p_dw_pc~0; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {54499#false} assume !(0 == ~q_free~0); {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 78: Hoare triple {54499#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 79: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {54499#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {54499#false} assume { :end_inline_do_write_p } true; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 82: Hoare triple {54499#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {54499#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {54499#false} assume !(0 == ~c_dr_pc~0); {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {54499#false} assume 2 == ~c_dr_pc~0; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {54499#false} do_read_c_~a~0#1 := ~a_t~0; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {54499#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {54499#false} assume !(~p_last_write~0 == ~c_last_read~0); {54499#false} is VALID [2022-02-20 20:01:26,716 INFO L272 TraceCheckUtils]: 89: Hoare triple {54499#false} call error1(); {54499#false} is VALID [2022-02-20 20:01:26,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {54499#false} assume !false; {54499#false} is VALID [2022-02-20 20:01:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:26,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:26,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888342316] [2022-02-20 20:01:26,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888342316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:26,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:26,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:26,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095996698] [2022-02-20 20:01:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:26,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:26,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:26,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:26,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:26,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:26,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:26,768 INFO L87 Difference]: Start difference. First operand 2059 states and 2729 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:30,352 INFO L93 Difference]: Finished difference Result 3586 states and 4693 transitions. [2022-02-20 20:01:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1082 transitions. [2022-02-20 20:01:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1082 transitions. [2022-02-20 20:01:30,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1082 transitions. [2022-02-20 20:01:31,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1082 edges. 1082 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:31,224 INFO L225 Difference]: With dead ends: 3586 [2022-02-20 20:01:31,225 INFO L226 Difference]: Without dead ends: 2133 [2022-02-20 20:01:31,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:01:31,227 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 1743 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:31,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 2166 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:01:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2022-02-20 20:01:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1838. [2022-02-20 20:01:31,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:31,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2133 states. Second operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:31,316 INFO L74 IsIncluded]: Start isIncluded. First operand 2133 states. Second operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:31,318 INFO L87 Difference]: Start difference. First operand 2133 states. Second operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:31,455 INFO L93 Difference]: Finished difference Result 2133 states and 2816 transitions. [2022-02-20 20:01:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2816 transitions. [2022-02-20 20:01:31,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:31,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:31,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 2133 states. [2022-02-20 20:01:31,464 INFO L87 Difference]: Start difference. First operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 2133 states. [2022-02-20 20:01:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:31,597 INFO L93 Difference]: Finished difference Result 2133 states and 2816 transitions. [2022-02-20 20:01:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2816 transitions. [2022-02-20 20:01:31,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:31,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:31,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:31,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1492 states have (on average 1.3505361930294906) internal successors, (2015), 1513 states have internal predecessors, (2015), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2443 transitions. [2022-02-20 20:01:31,748 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2443 transitions. Word has length 91 [2022-02-20 20:01:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:31,748 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2443 transitions. [2022-02-20 20:01:31,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2443 transitions. [2022-02-20 20:01:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:31,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:31,749 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:31,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:31,750 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1281768531, now seen corresponding path program 1 times [2022-02-20 20:01:31,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:31,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67577553] [2022-02-20 20:01:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {66112#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {66065#true} is VALID [2022-02-20 20:01:31,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66065#true} {66065#true} #1862#return; {66065#true} is VALID [2022-02-20 20:01:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume !(0 == ~q_write_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1864#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {66065#true} havoc ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume !(1 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} assume !(2 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} ~__retres1~0 := 0; {66065#true} is VALID [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {66065#true} #res := ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,823 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1858#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {66065#true} havoc ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume !(1 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} assume !(2 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} ~__retres1~1 := 0; {66065#true} is VALID [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {66065#true} #res := ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,827 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1860#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {66114#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,827 INFO L272 TraceCheckUtils]: 1: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {66065#true} is VALID [2022-02-20 20:01:31,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} havoc ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} assume !(1 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {66065#true} assume !(2 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {66065#true} ~__retres1~0 := 0; {66065#true} is VALID [2022-02-20 20:01:31,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {66065#true} #res := ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,828 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1858#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,829 INFO L272 TraceCheckUtils]: 11: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {66065#true} havoc ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {66065#true} assume !(1 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {66065#true} assume !(2 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {66065#true} ~__retres1~1 := 0; {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {66065#true} #res := ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,830 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1860#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,831 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {66070#(= ~c_dr_st~0 0)} #1866#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume !(1 == ~q_write_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1868#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {66065#true} havoc ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66065#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} #res := ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,839 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1870#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {66065#true} havoc ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} #res := ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66065#true} {66066#false} #1870#return; {66066#false} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {66065#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {66065#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {66065#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {66065#true} is VALID [2022-02-20 20:01:31,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {66065#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {66065#true} is VALID [2022-02-20 20:01:31,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {66065#true} call update_channels1(); {66112#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {66112#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {66065#true} is VALID [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,843 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66065#true} {66065#true} #1862#return; {66065#true} is VALID [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {66065#true} assume { :begin_inline_init_threads1 } true; {66065#true} is VALID [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {66065#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {66065#true} is VALID [2022-02-20 20:01:31,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {66065#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {66070#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {66070#(= ~c_dr_st~0 0)} call fire_delta_events1(); {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:31,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {66065#true} assume !(0 == ~q_write_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,845 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1864#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,845 INFO L272 TraceCheckUtils]: 17: Hoare triple {66070#(= ~c_dr_st~0 0)} call activate_threads1(); {66114#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:31,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {66114#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {66065#true} havoc ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {66065#true} assume !(1 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {66065#true} assume !(2 == ~p_dw_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {66065#true} ~__retres1~0 := 0; {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {66065#true} #res := ~__retres1~0; {66065#true} is VALID [2022-02-20 20:01:31,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,847 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1858#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,847 INFO L272 TraceCheckUtils]: 29: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {66065#true} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {66065#true} havoc ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {66065#true} assume !(1 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {66065#true} assume !(2 == ~c_dr_pc~0); {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {66065#true} ~__retres1~1 := 0; {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {66065#true} #res := ~__retres1~1; {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,848 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66065#true} {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1860#return; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:31,849 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {66115#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {66070#(= ~c_dr_st~0 0)} #1866#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,850 INFO L272 TraceCheckUtils]: 41: Hoare triple {66070#(= ~c_dr_st~0 0)} call reset_delta_events1(); {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {66113#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {66065#true} assume !(1 == ~q_write_ev~0); {66065#true} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,850 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1868#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {66070#(= ~c_dr_st~0 0)} assume !false; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {66070#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {66070#(= ~c_dr_st~0 0)} assume !false; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,851 INFO L272 TraceCheckUtils]: 49: Hoare triple {66070#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66065#true} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {66065#true} havoc ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {66065#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66065#true} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {66065#true} #res := ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,852 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {66065#true} {66070#(= ~c_dr_st~0 0)} #1870#return; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {66070#(= ~c_dr_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {66070#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {66070#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {66070#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {66070#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {66070#(= ~c_dr_st~0 0)} assume !false; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {66070#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {66070#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {66070#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {66070#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {66066#false} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {66066#false} assume !false; {66066#false} is VALID [2022-02-20 20:01:31,854 INFO L272 TraceCheckUtils]: 65: Hoare triple {66066#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66065#true} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {66065#true} havoc ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {66065#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66065#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {66065#true} #res := ~__retres1~2; {66065#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {66065#true} assume true; {66065#true} is VALID [2022-02-20 20:01:31,855 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {66065#true} {66066#false} #1870#return; {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {66066#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {66066#false} assume 0 != eval1_~tmp___1~0#1; {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 73: Hoare triple {66066#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {66066#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {66066#false} assume !(0 == ~p_dw_pc~0); {66066#false} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {66066#false} assume 1 == ~p_dw_pc~0; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {66066#false} assume !(0 == ~q_free~0); {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {66066#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 79: Hoare triple {66066#false} assume !false; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {66066#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {66066#false} assume { :end_inline_do_write_p } true; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {66066#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {66066#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {66066#false} assume !(0 == ~c_dr_pc~0); {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {66066#false} assume 2 == ~c_dr_pc~0; {66066#false} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {66066#false} do_read_c_~a~0#1 := ~a_t~0; {66066#false} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {66066#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {66066#false} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {66066#false} assume !(~p_last_write~0 == ~c_last_read~0); {66066#false} is VALID [2022-02-20 20:01:31,857 INFO L272 TraceCheckUtils]: 89: Hoare triple {66066#false} call error1(); {66066#false} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {66066#false} assume !false; {66066#false} is VALID [2022-02-20 20:01:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:01:31,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:31,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67577553] [2022-02-20 20:01:31,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67577553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:31,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:31,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:31,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122451626] [2022-02-20 20:01:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:31,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:31,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:31,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:31,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:31,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:31,902 INFO L87 Difference]: Start difference. First operand 1838 states and 2443 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:34,997 INFO L93 Difference]: Finished difference Result 4990 states and 6555 transitions. [2022-02-20 20:01:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1031 transitions. [2022-02-20 20:01:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1031 transitions. [2022-02-20 20:01:35,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1031 transitions. [2022-02-20 20:01:35,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1031 edges. 1031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:36,166 INFO L225 Difference]: With dead ends: 4990 [2022-02-20 20:01:36,166 INFO L226 Difference]: Without dead ends: 3521 [2022-02-20 20:01:36,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:01:36,168 INFO L933 BasicCegarLoop]: 727 mSDtfsCounter, 1659 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:36,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1692 Valid, 1818 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:01:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2022-02-20 20:01:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 3307. [2022-02-20 20:01:36,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:36,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3521 states. Second operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:36,352 INFO L74 IsIncluded]: Start isIncluded. First operand 3521 states. Second operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:36,357 INFO L87 Difference]: Start difference. First operand 3521 states. Second operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:36,737 INFO L93 Difference]: Finished difference Result 3521 states and 4611 transitions. [2022-02-20 20:01:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3521 states and 4611 transitions. [2022-02-20 20:01:36,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:36,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:36,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) Second operand 3521 states. [2022-02-20 20:01:36,750 INFO L87 Difference]: Start difference. First operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) Second operand 3521 states. [2022-02-20 20:01:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:37,133 INFO L93 Difference]: Finished difference Result 3521 states and 4611 transitions. [2022-02-20 20:01:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3521 states and 4611 transitions. [2022-02-20 20:01:37,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:37,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:37,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:37,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2641 states have (on average 1.30367285119273) internal successors, (3443), 2691 states have internal predecessors, (3443), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4315 transitions. [2022-02-20 20:01:37,668 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4315 transitions. Word has length 91 [2022-02-20 20:01:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:37,668 INFO L470 AbstractCegarLoop]: Abstraction has 3307 states and 4315 transitions. [2022-02-20 20:01:37,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4315 transitions. [2022-02-20 20:01:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:37,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:37,670 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:37,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:37,670 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1955360687, now seen corresponding path program 1 times [2022-02-20 20:01:37,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:37,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127709910] [2022-02-20 20:01:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {84324#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {84277#true} is VALID [2022-02-20 20:01:37,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84277#true} {84279#(= 1 ~c_dr_i~0)} #1862#return; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume !(0 == ~q_write_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84277#true} {84278#false} #1864#return; {84278#false} is VALID [2022-02-20 20:01:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {84277#true} havoc ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume !(1 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} assume !(2 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {84277#true} ~__retres1~0 := 0; {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {84277#true} #res := ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {84277#true} {84277#true} #1858#return; {84277#true} is VALID [2022-02-20 20:01:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {84277#true} havoc ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume !(1 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} assume !(2 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {84277#true} ~__retres1~1 := 0; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {84277#true} #res := ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {84277#true} {84277#true} #1860#return; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {84326#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L272 TraceCheckUtils]: 1: Hoare triple {84277#true} call #t~ret8 := is_do_write_p_triggered(); {84277#true} is VALID [2022-02-20 20:01:37,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} havoc ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {84277#true} assume !(1 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {84277#true} assume !(2 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {84277#true} ~__retres1~0 := 0; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {84277#true} #res := ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {84277#true} {84277#true} #1858#return; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {84277#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {84277#true} assume !(0 != ~tmp~1); {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {84277#true} call #t~ret9 := is_do_read_c_triggered(); {84277#true} is VALID [2022-02-20 20:01:37,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {84277#true} havoc ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {84277#true} assume !(1 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {84277#true} assume !(2 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {84277#true} ~__retres1~1 := 0; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {84277#true} #res := ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {84277#true} {84277#true} #1860#return; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {84277#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {84277#true} assume !(0 != ~tmp___0~1); {84277#true} is VALID [2022-02-20 20:01:37,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,766 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {84277#true} {84278#false} #1866#return; {84278#false} is VALID [2022-02-20 20:01:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume !(1 == ~q_write_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84277#true} {84278#false} #1868#return; {84278#false} is VALID [2022-02-20 20:01:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {84277#true} havoc ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84277#true} is VALID [2022-02-20 20:01:37,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} #res := ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,772 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {84277#true} {84278#false} #1870#return; {84278#false} is VALID [2022-02-20 20:01:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {84277#true} havoc ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84277#true} is VALID [2022-02-20 20:01:37,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} #res := ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,775 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {84277#true} {84278#false} #1870#return; {84278#false} is VALID [2022-02-20 20:01:37,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {84277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {84277#true} is VALID [2022-02-20 20:01:37,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {84277#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {84277#true} is VALID [2022-02-20 20:01:37,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {84277#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {84279#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {84279#(= 1 ~c_dr_i~0)} call update_channels1(); {84324#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:37,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {84324#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {84277#true} is VALID [2022-02-20 20:01:37,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,778 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {84277#true} {84279#(= 1 ~c_dr_i~0)} #1862#return; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {84279#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {84279#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {84279#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:37,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {84279#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {84278#false} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {84278#false} assume { :end_inline_init_threads1 } true; {84278#false} is VALID [2022-02-20 20:01:37,779 INFO L272 TraceCheckUtils]: 12: Hoare triple {84278#false} call fire_delta_events1(); {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {84277#true} assume !(0 == ~q_write_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {84277#true} {84278#false} #1864#return; {84278#false} is VALID [2022-02-20 20:01:37,779 INFO L272 TraceCheckUtils]: 17: Hoare triple {84278#false} call activate_threads1(); {84326#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {84326#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {84277#true} is VALID [2022-02-20 20:01:37,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {84277#true} call #t~ret8 := is_do_write_p_triggered(); {84277#true} is VALID [2022-02-20 20:01:37,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {84277#true} havoc ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {84277#true} assume !(1 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {84277#true} assume !(2 == ~p_dw_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {84277#true} ~__retres1~0 := 0; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {84277#true} #res := ~__retres1~0; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {84277#true} {84277#true} #1858#return; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {84277#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {84277#true} assume !(0 != ~tmp~1); {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L272 TraceCheckUtils]: 29: Hoare triple {84277#true} call #t~ret9 := is_do_read_c_triggered(); {84277#true} is VALID [2022-02-20 20:01:37,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {84277#true} havoc ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {84277#true} assume !(1 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {84277#true} assume !(2 == ~c_dr_pc~0); {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {84277#true} ~__retres1~1 := 0; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {84277#true} #res := ~__retres1~1; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {84277#true} {84277#true} #1860#return; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {84277#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {84277#true} assume !(0 != ~tmp___0~1); {84277#true} is VALID [2022-02-20 20:01:37,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,782 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {84277#true} {84278#false} #1866#return; {84278#false} is VALID [2022-02-20 20:01:37,782 INFO L272 TraceCheckUtils]: 41: Hoare triple {84278#false} call reset_delta_events1(); {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:37,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {84325#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {84277#true} assume !(1 == ~q_write_ev~0); {84277#true} is VALID [2022-02-20 20:01:37,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,782 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {84277#true} {84278#false} #1868#return; {84278#false} is VALID [2022-02-20 20:01:37,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {84278#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L272 TraceCheckUtils]: 49: Hoare triple {84278#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {84277#true} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {84277#true} havoc ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {84277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84277#true} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {84277#true} #res := ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,787 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {84277#true} {84278#false} #1870#return; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {84278#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {84278#false} assume 0 != eval1_~tmp___1~0#1; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {84278#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {84278#false} is VALID [2022-02-20 20:01:37,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {84278#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {84278#false} assume 0 == ~p_dw_pc~0; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {84278#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {84278#false} assume { :end_inline_do_write_p } true; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {84278#false} assume !(0 == ~c_dr_st~0); {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L272 TraceCheckUtils]: 65: Hoare triple {84278#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {84277#true} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {84277#true} havoc ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {84277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84277#true} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {84277#true} #res := ~__retres1~2; {84277#true} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {84277#true} assume true; {84277#true} is VALID [2022-02-20 20:01:37,788 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {84277#true} {84278#false} #1870#return; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {84278#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {84278#false} assume 0 != eval1_~tmp___1~0#1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 73: Hoare triple {84278#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 74: Hoare triple {84278#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {84278#false} assume !(0 == ~p_dw_pc~0); {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {84278#false} assume 1 == ~p_dw_pc~0; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {84278#false} assume !(0 == ~q_free~0); {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {84278#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {84278#false} is VALID [2022-02-20 20:01:37,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {84278#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {84278#false} assume { :end_inline_do_write_p } true; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {84278#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {84278#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {84278#false} assume !(0 == ~c_dr_pc~0); {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {84278#false} assume 2 == ~c_dr_pc~0; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {84278#false} do_read_c_~a~0#1 := ~a_t~0; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 87: Hoare triple {84278#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 88: Hoare triple {84278#false} assume !(~p_last_write~0 == ~c_last_read~0); {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L272 TraceCheckUtils]: 89: Hoare triple {84278#false} call error1(); {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {84278#false} assume !false; {84278#false} is VALID [2022-02-20 20:01:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:37,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:37,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127709910] [2022-02-20 20:01:37,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127709910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:37,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:37,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:37,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393053440] [2022-02-20 20:01:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:37,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:37,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:37,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:37,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:37,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:37,838 INFO L87 Difference]: Start difference. First operand 3307 states and 4315 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:40,435 INFO L93 Difference]: Finished difference Result 4891 states and 6299 transitions. [2022-02-20 20:01:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2022-02-20 20:01:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2022-02-20 20:01:40,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 876 transitions. [2022-02-20 20:01:40,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 876 edges. 876 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:41,110 INFO L225 Difference]: With dead ends: 4891 [2022-02-20 20:01:41,110 INFO L226 Difference]: Without dead ends: 1953 [2022-02-20 20:01:41,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:41,123 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 738 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:41,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1950 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2022-02-20 20:01:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1838. [2022-02-20 20:01:41,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:41,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1953 states. Second operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:41,203 INFO L74 IsIncluded]: Start isIncluded. First operand 1953 states. Second operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:41,205 INFO L87 Difference]: Start difference. First operand 1953 states. Second operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:41,318 INFO L93 Difference]: Finished difference Result 1953 states and 2566 transitions. [2022-02-20 20:01:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2566 transitions. [2022-02-20 20:01:41,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:41,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 1953 states. [2022-02-20 20:01:41,325 INFO L87 Difference]: Start difference. First operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 1953 states. [2022-02-20 20:01:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:41,437 INFO L93 Difference]: Finished difference Result 1953 states and 2566 transitions. [2022-02-20 20:01:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2566 transitions. [2022-02-20 20:01:41,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:41,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:41,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:41,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1492 states have (on average 1.3257372654155497) internal successors, (1978), 1513 states have internal predecessors, (1978), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2406 transitions. [2022-02-20 20:01:41,600 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2406 transitions. Word has length 91 [2022-02-20 20:01:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:41,600 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2406 transitions. [2022-02-20 20:01:41,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2406 transitions. [2022-02-20 20:01:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:41,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:41,601 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:41,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:41,602 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1143882069, now seen corresponding path program 1 times [2022-02-20 20:01:41,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:41,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577820566] [2022-02-20 20:01:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {97305#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:41,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:41,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {97259#(= ~q_read_ev~0 2)} #1862#return; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume !(0 == ~q_write_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97257#true} {97259#(= ~q_read_ev~0 2)} #1864#return; {97257#true} is VALID [2022-02-20 20:01:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {97257#true} havoc ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume !(1 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} assume !(2 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {97257#true} ~__retres1~0 := 0; {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {97257#true} #res := ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {97257#true} {97257#true} #1858#return; {97257#true} is VALID [2022-02-20 20:01:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {97257#true} havoc ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume !(1 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} assume !(2 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {97257#true} ~__retres1~1 := 0; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {97257#true} #res := ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {97257#true} {97257#true} #1860#return; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {97308#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L272 TraceCheckUtils]: 1: Hoare triple {97257#true} call #t~ret8 := is_do_write_p_triggered(); {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} havoc ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {97257#true} assume !(1 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {97257#true} assume !(2 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {97257#true} ~__retres1~0 := 0; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {97257#true} #res := ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {97257#true} {97257#true} #1858#return; {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {97257#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {97257#true} assume !(0 != ~tmp~1); {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L272 TraceCheckUtils]: 11: Hoare triple {97257#true} call #t~ret9 := is_do_read_c_triggered(); {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {97257#true} havoc ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {97257#true} assume !(1 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {97257#true} assume !(2 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {97257#true} ~__retres1~1 := 0; {97257#true} is VALID [2022-02-20 20:01:41,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {97257#true} #res := ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {97257#true} {97257#true} #1860#return; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {97257#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {97257#true} assume !(0 != ~tmp___0~1); {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {97257#true} {97257#true} #1866#return; {97257#true} is VALID [2022-02-20 20:01:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume !(1 == ~q_write_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97257#true} {97257#true} #1868#return; {97257#true} is VALID [2022-02-20 20:01:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {97257#true} havoc ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {97257#true} is VALID [2022-02-20 20:01:41,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} #res := ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,690 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {97257#true} {97257#true} #1870#return; {97257#true} is VALID [2022-02-20 20:01:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:41,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {97257#true} havoc ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {97323#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {97323#(= ~p_dw_st~0 0)} assume true; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,699 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {97323#(= ~p_dw_st~0 0)} {97299#(not (= ~p_dw_st~0 0))} #1870#return; {97258#false} is VALID [2022-02-20 20:01:41,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {97257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {97257#true} is VALID [2022-02-20 20:01:41,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {97257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {97257#true} is VALID [2022-02-20 20:01:41,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {97257#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {97259#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {97259#(= ~q_read_ev~0 2)} call update_channels1(); {97305#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:41,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {97305#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:41,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:41,702 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {97306#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {97259#(= ~q_read_ev~0 2)} #1862#return; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {97259#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {97259#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {97259#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {97259#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {97259#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:41,704 INFO L272 TraceCheckUtils]: 12: Hoare triple {97259#(= ~q_read_ev~0 2)} call fire_delta_events1(); {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:41,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {97257#true} assume !(0 == ~q_write_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,704 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {97257#true} {97259#(= ~q_read_ev~0 2)} #1864#return; {97257#true} is VALID [2022-02-20 20:01:41,704 INFO L272 TraceCheckUtils]: 17: Hoare triple {97257#true} call activate_threads1(); {97308#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:41,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {97308#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L272 TraceCheckUtils]: 19: Hoare triple {97257#true} call #t~ret8 := is_do_write_p_triggered(); {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {97257#true} havoc ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {97257#true} assume !(1 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {97257#true} assume !(2 == ~p_dw_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {97257#true} ~__retres1~0 := 0; {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {97257#true} #res := ~__retres1~0; {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,705 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {97257#true} {97257#true} #1858#return; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {97257#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {97257#true} assume !(0 != ~tmp~1); {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L272 TraceCheckUtils]: 29: Hoare triple {97257#true} call #t~ret9 := is_do_read_c_triggered(); {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {97257#true} havoc ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {97257#true} assume !(1 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {97257#true} assume !(2 == ~c_dr_pc~0); {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {97257#true} ~__retres1~1 := 0; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {97257#true} #res := ~__retres1~1; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,706 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {97257#true} {97257#true} #1860#return; {97257#true} is VALID [2022-02-20 20:01:41,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {97257#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {97257#true} is VALID [2022-02-20 20:01:41,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {97257#true} assume !(0 != ~tmp___0~1); {97257#true} is VALID [2022-02-20 20:01:41,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,707 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {97257#true} {97257#true} #1866#return; {97257#true} is VALID [2022-02-20 20:01:41,707 INFO L272 TraceCheckUtils]: 41: Hoare triple {97257#true} call reset_delta_events1(); {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:41,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {97307#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {97257#true} assume !(1 == ~q_write_ev~0); {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {97257#true} {97257#true} #1868#return; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {97257#true} assume !false; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {97257#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {97257#true} assume !false; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L272 TraceCheckUtils]: 49: Hoare triple {97257#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {97257#true} havoc ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {97257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {97257#true} #res := ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {97257#true} assume true; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {97257#true} {97257#true} #1870#return; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {97257#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {97257#true} assume 0 != eval1_~tmp___1~0#1; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {97257#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {97257#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {97257#true} assume 0 == ~p_dw_pc~0; {97257#true} is VALID [2022-02-20 20:01:41,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {97257#true} assume !false; {97257#true} is VALID [2022-02-20 20:01:41,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {97257#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {97299#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:41,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {97299#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {97299#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:41,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {97299#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {97299#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:41,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {97299#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {97299#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:41,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {97299#(not (= ~p_dw_st~0 0))} assume !false; {97299#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:41,711 INFO L272 TraceCheckUtils]: 66: Hoare triple {97299#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {97257#true} is VALID [2022-02-20 20:01:41,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {97257#true} havoc ~__retres1~2; {97257#true} is VALID [2022-02-20 20:01:41,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {97257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {97323#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {97323#(= ~p_dw_st~0 0)} assume true; {97323#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:41,712 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {97323#(= ~p_dw_st~0 0)} {97299#(not (= ~p_dw_st~0 0))} #1870#return; {97258#false} is VALID [2022-02-20 20:01:41,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {97258#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {97258#false} is VALID [2022-02-20 20:01:41,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {97258#false} assume 0 != eval1_~tmp___1~0#1; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {97258#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {97258#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {97258#false} assume !(0 == ~p_dw_pc~0); {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {97258#false} assume 1 == ~p_dw_pc~0; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {97258#false} assume !(0 == ~q_free~0); {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {97258#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {97258#false} assume !false; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {97258#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {97258#false} assume { :end_inline_do_write_p } true; {97258#false} is VALID [2022-02-20 20:01:41,713 INFO L290 TraceCheckUtils]: 83: Hoare triple {97258#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {97258#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {97258#false} assume !(0 == ~c_dr_pc~0); {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {97258#false} assume 2 == ~c_dr_pc~0; {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {97258#false} do_read_c_~a~0#1 := ~a_t~0; {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {97258#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {97258#false} assume !(~p_last_write~0 == ~c_last_read~0); {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L272 TraceCheckUtils]: 90: Hoare triple {97258#false} call error1(); {97258#false} is VALID [2022-02-20 20:01:41,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {97258#false} assume !false; {97258#false} is VALID [2022-02-20 20:01:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:01:41,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:41,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577820566] [2022-02-20 20:01:41,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577820566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:41,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:41,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:41,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29675453] [2022-02-20 20:01:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:41,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:41,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:41,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:41,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:41,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:41,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:41,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:41,763 INFO L87 Difference]: Start difference. First operand 1838 states and 2406 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)