./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.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_2.cil-1+token_ring.06.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 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:03,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:03,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:03,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:03,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:03,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:03,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:03,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:03,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:03,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:03,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:03,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:03,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:03,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:03,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:03,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:03,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:03,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:03,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:03,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:03,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:03,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:03,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:03,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:03,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:03,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:03,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:03,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:03,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:03,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:03,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:03,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:03,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:03,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:03,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:03,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:03,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:03,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:03,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:03,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:03,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:03,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:57:03,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:03,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:03,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:03,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:03,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:03,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:03,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:03,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:03,534 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:03,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:03,535 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:03,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:03,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:03,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:03,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:03,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:03,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:03,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:03,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:03,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:03,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:03,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:03,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:03,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:03,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:03,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:03,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:03,540 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 -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2022-02-20 19:57:03,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:03,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:03,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:03,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:03,743 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:03,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-02-20 19:57:03,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84f0ca66/ae0b8fcff69749d5987f0fd7a5b4b97d/FLAG99be7d534 [2022-02-20 19:57:04,167 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:04,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-02-20 19:57:04,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84f0ca66/ae0b8fcff69749d5987f0fd7a5b4b97d/FLAG99be7d534 [2022-02-20 19:57:04,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84f0ca66/ae0b8fcff69749d5987f0fd7a5b4b97d [2022-02-20 19:57:04,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:04,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:04,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:04,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:04,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:04,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2e757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04, skipping insertion in model container [2022-02-20 19:57:04,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:04,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:04,351 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_2.cil-1+token_ring.06.cil-1.c[914,927] [2022-02-20 19:57:04,399 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_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2022-02-20 19:57:04,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:04,476 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:04,483 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_2.cil-1+token_ring.06.cil-1.c[914,927] [2022-02-20 19:57:04,497 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_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2022-02-20 19:57:04,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:04,561 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:04,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04 WrapperNode [2022-02-20 19:57:04,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:04,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:04,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:04,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:04,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,621 INFO L137 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 697 [2022-02-20 19:57:04,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:04,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:04,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:04,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:04,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:04,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:04,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:04,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:04,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (1/1) ... [2022-02-20 19:57:04,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:04,714 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 19:57:04,719 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 19:57:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:04,738 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:04,738 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:04,738 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:04,738 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:04,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:04,742 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:04,742 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:04,830 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:04,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:05,470 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:05,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:05,488 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-02-20 19:57:05,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:05 BoogieIcfgContainer [2022-02-20 19:57:05,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:05,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:05,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:05,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:05,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:04" (1/3) ... [2022-02-20 19:57:05,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e230382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:05, skipping insertion in model container [2022-02-20 19:57:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:04" (2/3) ... [2022-02-20 19:57:05,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e230382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:05, skipping insertion in model container [2022-02-20 19:57:05,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:05" (3/3) ... [2022-02-20 19:57:05,497 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-02-20 19:57:05,500 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:05,501 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:05,553 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:05,559 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 19:57:05,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 341 states, 287 states have (on average 1.613240418118467) internal successors, (463), 295 states have internal predecessors, (463), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 19:57:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:05,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:05,613 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 19:57:05,614 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1403683270, now seen corresponding path program 1 times [2022-02-20 19:57:05,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:05,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184254071] [2022-02-20 19:57:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#(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); {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:05,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:05,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {346#(= ~q_read_ev~0 2)} #1241#return; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#(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; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#(= |old(~q_read_ev~0)| 0)} assume true; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {387#(= |old(~q_read_ev~0)| 0)} {346#(= ~q_read_ev~0 2)} #1243#return; {345#false} is VALID [2022-02-20 19:57:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#true} havoc ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume 1 == ~p_dw_pc~0; {344#true} is VALID [2022-02-20 19:57:05,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {344#true} is VALID [2022-02-20 19:57:05,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#true} #res := ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,920 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {344#true} {344#true} #1237#return; {344#true} is VALID [2022-02-20 19:57:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#true} havoc ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume 1 == ~c_dr_pc~0; {344#true} is VALID [2022-02-20 19:57:05,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {344#true} is VALID [2022-02-20 19:57:05,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#true} #res := ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,936 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {344#true} {344#true} #1239#return; {344#true} is VALID [2022-02-20 19:57:05,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {388#(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; {344#true} is VALID [2022-02-20 19:57:05,937 INFO L272 TraceCheckUtils]: 1: Hoare triple {344#true} call #t~ret8 := is_do_write_p_triggered(); {344#true} is VALID [2022-02-20 19:57:05,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} havoc ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#true} assume 1 == ~p_dw_pc~0; {344#true} is VALID [2022-02-20 19:57:05,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {344#true} is VALID [2022-02-20 19:57:05,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#true} #res := ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,938 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {344#true} {344#true} #1237#return; {344#true} is VALID [2022-02-20 19:57:05,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {344#true} is VALID [2022-02-20 19:57:05,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#true} assume !(0 != ~tmp~1); {344#true} is VALID [2022-02-20 19:57:05,939 INFO L272 TraceCheckUtils]: 10: Hoare triple {344#true} call #t~ret9 := is_do_read_c_triggered(); {344#true} is VALID [2022-02-20 19:57:05,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#true} havoc ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {344#true} assume 1 == ~c_dr_pc~0; {344#true} is VALID [2022-02-20 19:57:05,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {344#true} is VALID [2022-02-20 19:57:05,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#true} #res := ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,940 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {344#true} {344#true} #1239#return; {344#true} is VALID [2022-02-20 19:57:05,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {344#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {344#true} is VALID [2022-02-20 19:57:05,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {344#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {344#true} is VALID [2022-02-20 19:57:05,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,945 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {344#true} {345#false} #1245#return; {345#false} is VALID [2022-02-20 19:57:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#(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); {344#true} is VALID [2022-02-20 19:57:05,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {344#true} is VALID [2022-02-20 19:57:05,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {345#false} #1247#return; {345#false} is VALID [2022-02-20 19:57:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#true} havoc ~__retres1~2; {344#true} is VALID [2022-02-20 19:57:05,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {344#true} is VALID [2022-02-20 19:57:05,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} #res := ~__retres1~2; {344#true} is VALID [2022-02-20 19:57:05,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,970 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {344#true} {345#false} #1249#return; {345#false} is VALID [2022-02-20 19:57:05,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {344#true} is VALID [2022-02-20 19:57:05,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {344#true} is VALID [2022-02-20 19:57:05,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {346#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {346#(= ~q_read_ev~0 2)} call update_channels1(); {384#(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 19:57:05,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(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); {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:05,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:05,978 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {385#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {346#(= ~q_read_ev~0 2)} #1241#return; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {346#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {346#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {346#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:05,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {346#(= ~q_read_ev~0 2)} call fire_delta_events1(); {386#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:05,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#(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; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {387#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {387#(= |old(~q_read_ev~0)| 0)} assume true; {387#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:05,983 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {387#(= |old(~q_read_ev~0)| 0)} {346#(= ~q_read_ev~0 2)} #1243#return; {345#false} is VALID [2022-02-20 19:57:05,983 INFO L272 TraceCheckUtils]: 17: Hoare triple {345#false} call activate_threads1(); {388#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:05,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {388#(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; {344#true} is VALID [2022-02-20 19:57:05,983 INFO L272 TraceCheckUtils]: 19: Hoare triple {344#true} call #t~ret8 := is_do_write_p_triggered(); {344#true} is VALID [2022-02-20 19:57:05,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {344#true} havoc ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {344#true} assume 1 == ~p_dw_pc~0; {344#true} is VALID [2022-02-20 19:57:05,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {344#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {344#true} is VALID [2022-02-20 19:57:05,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {344#true} #res := ~__retres1~0; {344#true} is VALID [2022-02-20 19:57:05,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,985 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {344#true} {344#true} #1237#return; {344#true} is VALID [2022-02-20 19:57:05,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {344#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {344#true} is VALID [2022-02-20 19:57:05,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {344#true} assume !(0 != ~tmp~1); {344#true} is VALID [2022-02-20 19:57:05,985 INFO L272 TraceCheckUtils]: 28: Hoare triple {344#true} call #t~ret9 := is_do_read_c_triggered(); {344#true} is VALID [2022-02-20 19:57:05,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {344#true} havoc ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {344#true} assume 1 == ~c_dr_pc~0; {344#true} is VALID [2022-02-20 19:57:05,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {344#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {344#true} is VALID [2022-02-20 19:57:05,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {344#true} #res := ~__retres1~1; {344#true} is VALID [2022-02-20 19:57:05,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,987 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {344#true} {344#true} #1239#return; {344#true} is VALID [2022-02-20 19:57:05,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {344#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {344#true} is VALID [2022-02-20 19:57:05,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {344#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {344#true} is VALID [2022-02-20 19:57:05,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,988 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {344#true} {345#false} #1245#return; {345#false} is VALID [2022-02-20 19:57:05,988 INFO L272 TraceCheckUtils]: 39: Hoare triple {345#false} call reset_delta_events1(); {386#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:05,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {386#(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); {344#true} is VALID [2022-02-20 19:57:05,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {344#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {344#true} is VALID [2022-02-20 19:57:05,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:05,989 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {344#true} {345#false} #1247#return; {345#false} is VALID [2022-02-20 19:57:05,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-02-20 19:57:06,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {345#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; {345#false} is VALID [2022-02-20 19:57:06,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-02-20 19:57:06,003 INFO L272 TraceCheckUtils]: 47: Hoare triple {345#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {344#true} is VALID [2022-02-20 19:57:06,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {344#true} havoc ~__retres1~2; {344#true} is VALID [2022-02-20 19:57:06,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {344#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {344#true} is VALID [2022-02-20 19:57:06,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {344#true} #res := ~__retres1~2; {344#true} is VALID [2022-02-20 19:57:06,003 INFO L290 TraceCheckUtils]: 51: Hoare triple {344#true} assume true; {344#true} is VALID [2022-02-20 19:57:06,005 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {344#true} {345#false} #1249#return; {345#false} is VALID [2022-02-20 19:57:06,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {345#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; {345#false} is VALID [2022-02-20 19:57:06,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {345#false} assume 0 != eval1_~tmp___1~0#1; {345#false} is VALID [2022-02-20 19:57:06,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {345#false} assume !(0 == ~p_dw_st~0); {345#false} is VALID [2022-02-20 19:57:06,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {345#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; {345#false} is VALID [2022-02-20 19:57:06,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {345#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; {345#false} is VALID [2022-02-20 19:57:06,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {345#false} assume 0 == ~c_dr_pc~0; {345#false} is VALID [2022-02-20 19:57:06,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-02-20 19:57:06,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {345#false} assume !(1 == ~q_free~0); {345#false} is VALID [2022-02-20 19:57:06,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {345#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; {345#false} is VALID [2022-02-20 19:57:06,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {345#false} assume !(~p_last_write~0 == ~c_last_read~0); {345#false} is VALID [2022-02-20 19:57:06,009 INFO L272 TraceCheckUtils]: 63: Hoare triple {345#false} call error1(); {345#false} is VALID [2022-02-20 19:57:06,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-02-20 19:57:06,011 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 19:57:06,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:06,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184254071] [2022-02-20 19:57:06,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184254071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:06,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:06,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:06,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556394725] [2022-02-20 19:57:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:06,022 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 19:57:06,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:06,026 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 19:57:06,081 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 19:57:06,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:06,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:06,114 INFO L87 Difference]: Start difference. First operand has 341 states, 287 states have (on average 1.613240418118467) internal successors, (463), 295 states have internal predecessors, (463), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) 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 19:57:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:08,342 INFO L93 Difference]: Finished difference Result 794 states and 1240 transitions. [2022-02-20 19:57:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:08,343 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 19:57:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:08,344 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 19:57:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1240 transitions. [2022-02-20 19:57:08,367 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 19:57:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1240 transitions. [2022-02-20 19:57:08,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1240 transitions. [2022-02-20 19:57:09,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1240 edges. 1240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:09,225 INFO L225 Difference]: With dead ends: 794 [2022-02-20 19:57:09,225 INFO L226 Difference]: Without dead ends: 465 [2022-02-20 19:57:09,229 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 19:57:09,231 INFO L933 BasicCegarLoop]: 521 mSDtfsCounter, 833 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:09,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 1506 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-02-20 19:57:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2022-02-20 19:57:09,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:09,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:09,284 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:09,285 INFO L87 Difference]: Start difference. First operand 465 states. Second operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,307 INFO L93 Difference]: Finished difference Result 465 states and 679 transitions. [2022-02-20 19:57:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 679 transitions. [2022-02-20 19:57:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:09,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:09,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 465 states. [2022-02-20 19:57:09,318 INFO L87 Difference]: Start difference. First operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 465 states. [2022-02-20 19:57:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,336 INFO L93 Difference]: Finished difference Result 465 states and 679 transitions. [2022-02-20 19:57:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 679 transitions. [2022-02-20 19:57:09,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:09,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:09,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:09,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 355 states have (on average 1.4929577464788732) internal successors, (530), 362 states have internal predecessors, (530), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 625 transitions. [2022-02-20 19:57:09,360 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 625 transitions. Word has length 65 [2022-02-20 19:57:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:09,364 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 625 transitions. [2022-02-20 19:57:09,366 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 19:57:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 625 transitions. [2022-02-20 19:57:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:09,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:09,369 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 19:57:09,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:09,370 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1666920611, now seen corresponding path program 1 times [2022-02-20 19:57:09,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:09,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061934633] [2022-02-20 19:57:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {3030#(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); {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2992#(= ~q_write_ev~0 ~q_read_ev~0)} #1241#return; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {3031#(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); {3032#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {3032#(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; {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2992#(= ~q_write_ev~0 ~q_read_ev~0)} #1243#return; {2991#false} is VALID [2022-02-20 19:57:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#true} havoc ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume !(1 == ~p_dw_pc~0); {2990#true} is VALID [2022-02-20 19:57:09,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} ~__retres1~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {2990#true} #res := ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,526 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2990#true} {2990#true} #1237#return; {2990#true} is VALID [2022-02-20 19:57:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#true} havoc ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume 1 == ~c_dr_pc~0; {2990#true} is VALID [2022-02-20 19:57:09,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {2990#true} #res := ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2990#true} {2990#true} #1239#return; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {3034#(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; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L272 TraceCheckUtils]: 1: Hoare triple {2990#true} call #t~ret8 := is_do_write_p_triggered(); {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} havoc ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {2990#true} assume !(1 == ~p_dw_pc~0); {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {2990#true} ~__retres1~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2990#true} #res := ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2990#true} {2990#true} #1237#return; {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {2990#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2990#true} assume !(0 != ~tmp~1); {2990#true} is VALID [2022-02-20 19:57:09,533 INFO L272 TraceCheckUtils]: 10: Hoare triple {2990#true} call #t~ret9 := is_do_read_c_triggered(); {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {2990#true} havoc ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {2990#true} assume 1 == ~c_dr_pc~0; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2990#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {2990#true} #res := ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2990#true} {2990#true} #1239#return; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {2990#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2990#true} is VALID [2022-02-20 19:57:09,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {2990#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,535 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2990#true} {2991#false} #1245#return; {2991#false} is VALID [2022-02-20 19:57:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {3031#(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); {2990#true} is VALID [2022-02-20 19:57:09,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2990#true} is VALID [2022-02-20 19:57:09,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2991#false} #1247#return; {2991#false} is VALID [2022-02-20 19:57:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#true} havoc ~__retres1~2; {2990#true} is VALID [2022-02-20 19:57:09,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2990#true} is VALID [2022-02-20 19:57:09,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} #res := ~__retres1~2; {2990#true} is VALID [2022-02-20 19:57:09,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,552 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2990#true} {2991#false} #1249#return; {2991#false} is VALID [2022-02-20 19:57:09,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {2990#true} is VALID [2022-02-20 19:57:09,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {2992#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3030#(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 19:57:09,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3030#(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); {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,554 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2992#(= ~q_write_ev~0 ~q_read_ev~0)} #1241#return; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2992#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:09,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {2992#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {3031#(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); {3032#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {3032#(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; {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:09,558 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3033#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2992#(= ~q_write_ev~0 ~q_read_ev~0)} #1243#return; {2991#false} is VALID [2022-02-20 19:57:09,558 INFO L272 TraceCheckUtils]: 17: Hoare triple {2991#false} call activate_threads1(); {3034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:09,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {3034#(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; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L272 TraceCheckUtils]: 19: Hoare triple {2990#true} call #t~ret8 := is_do_write_p_triggered(); {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {2990#true} havoc ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {2990#true} assume !(1 == ~p_dw_pc~0); {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {2990#true} ~__retres1~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {2990#true} #res := ~__retres1~0; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2990#true} {2990#true} #1237#return; {2990#true} is VALID [2022-02-20 19:57:09,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {2990#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {2990#true} assume !(0 != ~tmp~1); {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L272 TraceCheckUtils]: 28: Hoare triple {2990#true} call #t~ret9 := is_do_read_c_triggered(); {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {2990#true} havoc ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {2990#true} assume 1 == ~c_dr_pc~0; {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {2990#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {2990#true} #res := ~__retres1~1; {2990#true} is VALID [2022-02-20 19:57:09,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,561 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2990#true} {2990#true} #1239#return; {2990#true} is VALID [2022-02-20 19:57:09,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {2990#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2990#true} is VALID [2022-02-20 19:57:09,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {2990#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2990#true} is VALID [2022-02-20 19:57:09,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,564 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2990#true} {2991#false} #1245#return; {2991#false} is VALID [2022-02-20 19:57:09,565 INFO L272 TraceCheckUtils]: 39: Hoare triple {2991#false} call reset_delta_events1(); {3031#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {3031#(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); {2990#true} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {2990#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2990#true} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,566 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2990#true} {2991#false} #1247#return; {2991#false} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {2991#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; {2991#false} is VALID [2022-02-20 19:57:09,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-02-20 19:57:09,567 INFO L272 TraceCheckUtils]: 47: Hoare triple {2991#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2990#true} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {2990#true} havoc ~__retres1~2; {2990#true} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {2990#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2990#true} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {2990#true} #res := ~__retres1~2; {2990#true} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-02-20 19:57:09,567 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2990#true} {2991#false} #1249#return; {2991#false} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {2991#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; {2991#false} is VALID [2022-02-20 19:57:09,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {2991#false} assume 0 != eval1_~tmp___1~0#1; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {2991#false} assume !(0 == ~p_dw_st~0); {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {2991#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; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {2991#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; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {2991#false} assume 0 == ~c_dr_pc~0; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {2991#false} assume !(1 == ~q_free~0); {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {2991#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; {2991#false} is VALID [2022-02-20 19:57:09,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {2991#false} assume !(~p_last_write~0 == ~c_last_read~0); {2991#false} is VALID [2022-02-20 19:57:09,569 INFO L272 TraceCheckUtils]: 63: Hoare triple {2991#false} call error1(); {2991#false} is VALID [2022-02-20 19:57:09,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-02-20 19:57:09,569 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 19:57:09,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:09,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061934633] [2022-02-20 19:57:09,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061934633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:09,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:09,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:09,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165667443] [2022-02-20 19:57:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:09,571 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 19:57:09,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:09,572 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 19:57:09,613 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 19:57:09,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:09,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:09,615 INFO L87 Difference]: Start difference. First operand 426 states and 625 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 19:57:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,417 INFO L93 Difference]: Finished difference Result 773 states and 1102 transitions. [2022-02-20 19:57:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:12,418 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 19:57:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:12,418 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 19:57:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 831 transitions. [2022-02-20 19:57:12,437 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 19:57:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 831 transitions. [2022-02-20 19:57:12,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 831 transitions. [2022-02-20 19:57:13,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:13,050 INFO L225 Difference]: With dead ends: 773 [2022-02-20 19:57:13,051 INFO L226 Difference]: Without dead ends: 596 [2022-02-20 19:57:13,051 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 19:57:13,052 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 998 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:13,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 1929 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-02-20 19:57:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 522. [2022-02-20 19:57:13,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:13,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 596 states. Second operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:13,077 INFO L74 IsIncluded]: Start isIncluded. First operand 596 states. Second operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:13,078 INFO L87 Difference]: Start difference. First operand 596 states. Second operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,108 INFO L93 Difference]: Finished difference Result 596 states and 862 transitions. [2022-02-20 19:57:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 862 transitions. [2022-02-20 19:57:13,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 596 states. [2022-02-20 19:57:13,112 INFO L87 Difference]: Start difference. First operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 596 states. [2022-02-20 19:57:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,134 INFO L93 Difference]: Finished difference Result 596 states and 862 transitions. [2022-02-20 19:57:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 862 transitions. [2022-02-20 19:57:13,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 431 states have (on average 1.4709976798143851) internal successors, (634), 440 states have internal predecessors, (634), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 759 transitions. [2022-02-20 19:57:13,158 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 759 transitions. Word has length 65 [2022-02-20 19:57:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,159 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 759 transitions. [2022-02-20 19:57:13,159 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 19:57:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 759 transitions. [2022-02-20 19:57:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:13,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,161 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 19:57:13,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:13,161 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash -361665499, now seen corresponding path program 1 times [2022-02-20 19:57:13,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999355077] [2022-02-20 19:57:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#(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); {6052#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:13,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#(not (= |old(~q_req_up~0)| 1))} assume true; {6052#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:13,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#(not (= |old(~q_req_up~0)| 1))} {6012#(= ~c_dr_pc~0 ~q_req_up~0)} #1241#return; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {6053#(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); {6009#true} is VALID [2022-02-20 19:57:13,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {6009#true} assume !(0 == ~q_write_ev~0); {6009#true} is VALID [2022-02-20 19:57:13,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6009#true} {6016#(not (= ~c_dr_pc~0 1))} #1243#return; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {6009#true} havoc ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {6009#true} assume !(1 == ~p_dw_pc~0); {6009#true} is VALID [2022-02-20 19:57:13,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#true} ~__retres1~0 := 0; {6009#true} is VALID [2022-02-20 19:57:13,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {6009#true} #res := ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,277 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6009#true} {6009#true} #1237#return; {6009#true} is VALID [2022-02-20 19:57:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {6009#true} havoc ~__retres1~1; {6009#true} is VALID [2022-02-20 19:57:13,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {6009#true} assume 1 == ~c_dr_pc~0; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,285 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} {6009#true} #1239#return; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {6054#(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; {6009#true} is VALID [2022-02-20 19:57:13,286 INFO L272 TraceCheckUtils]: 1: Hoare triple {6009#true} call #t~ret8 := is_do_write_p_triggered(); {6009#true} is VALID [2022-02-20 19:57:13,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#true} havoc ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {6009#true} assume !(1 == ~p_dw_pc~0); {6009#true} is VALID [2022-02-20 19:57:13,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {6009#true} ~__retres1~0 := 0; {6009#true} is VALID [2022-02-20 19:57:13,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {6009#true} #res := ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6009#true} {6009#true} #1237#return; {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {6009#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {6009#true} assume !(0 != ~tmp~1); {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L272 TraceCheckUtils]: 10: Hoare triple {6009#true} call #t~ret9 := is_do_read_c_triggered(); {6009#true} is VALID [2022-02-20 19:57:13,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {6009#true} havoc ~__retres1~1; {6009#true} is VALID [2022-02-20 19:57:13,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {6009#true} assume 1 == ~c_dr_pc~0; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} {6009#true} #1239#return; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,290 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} {6016#(not (= ~c_dr_pc~0 1))} #1245#return; {6010#false} is VALID [2022-02-20 19:57:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {6053#(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); {6009#true} is VALID [2022-02-20 19:57:13,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {6009#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6009#true} is VALID [2022-02-20 19:57:13,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6009#true} {6010#false} #1247#return; {6010#false} is VALID [2022-02-20 19:57:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {6009#true} havoc ~__retres1~2; {6009#true} is VALID [2022-02-20 19:57:13,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {6009#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6009#true} is VALID [2022-02-20 19:57:13,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#true} #res := ~__retres1~2; {6009#true} is VALID [2022-02-20 19:57:13,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,299 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6009#true} {6010#false} #1249#return; {6010#false} is VALID [2022-02-20 19:57:13,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {6009#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {6011#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:13,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {6011#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {6011#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:13,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {6011#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {6012#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:13,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {6012#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {6012#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:13,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {6051#(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 19:57:13,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {6051#(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); {6052#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:13,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#(not (= |old(~q_req_up~0)| 1))} assume true; {6052#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:13,302 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6052#(not (= |old(~q_req_up~0)| 1))} {6012#(= ~c_dr_pc~0 ~q_req_up~0)} #1241#return; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {6053#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {6053#(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); {6009#true} is VALID [2022-02-20 19:57:13,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {6009#true} assume !(0 == ~q_write_ev~0); {6009#true} is VALID [2022-02-20 19:57:13,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6009#true} {6016#(not (= ~c_dr_pc~0 1))} #1243#return; {6016#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:13,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {6016#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {6054#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:13,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {6054#(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; {6009#true} is VALID [2022-02-20 19:57:13,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {6009#true} call #t~ret8 := is_do_write_p_triggered(); {6009#true} is VALID [2022-02-20 19:57:13,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {6009#true} havoc ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {6009#true} assume !(1 == ~p_dw_pc~0); {6009#true} is VALID [2022-02-20 19:57:13,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {6009#true} ~__retres1~0 := 0; {6009#true} is VALID [2022-02-20 19:57:13,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {6009#true} #res := ~__retres1~0; {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6009#true} {6009#true} #1237#return; {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {6009#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {6009#true} assume !(0 != ~tmp~1); {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {6009#true} call #t~ret9 := is_do_read_c_triggered(); {6009#true} is VALID [2022-02-20 19:57:13,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {6009#true} havoc ~__retres1~1; {6009#true} is VALID [2022-02-20 19:57:13,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {6009#true} assume 1 == ~c_dr_pc~0; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,308 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} {6009#true} #1239#return; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:13,310 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6067#(= (+ (- 1) ~c_dr_pc~0) 0)} {6016#(not (= ~c_dr_pc~0 1))} #1245#return; {6010#false} is VALID [2022-02-20 19:57:13,310 INFO L272 TraceCheckUtils]: 39: Hoare triple {6010#false} call reset_delta_events1(); {6053#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {6053#(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); {6009#true} is VALID [2022-02-20 19:57:13,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {6009#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6009#true} is VALID [2022-02-20 19:57:13,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,310 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6009#true} {6010#false} #1247#return; {6010#false} is VALID [2022-02-20 19:57:13,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {6010#false} assume !false; {6010#false} is VALID [2022-02-20 19:57:13,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {6010#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; {6010#false} is VALID [2022-02-20 19:57:13,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {6010#false} assume !false; {6010#false} is VALID [2022-02-20 19:57:13,311 INFO L272 TraceCheckUtils]: 47: Hoare triple {6010#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6009#true} is VALID [2022-02-20 19:57:13,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {6009#true} havoc ~__retres1~2; {6009#true} is VALID [2022-02-20 19:57:13,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {6009#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6009#true} is VALID [2022-02-20 19:57:13,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {6009#true} #res := ~__retres1~2; {6009#true} is VALID [2022-02-20 19:57:13,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {6009#true} assume true; {6009#true} is VALID [2022-02-20 19:57:13,311 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6009#true} {6010#false} #1249#return; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {6010#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; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {6010#false} assume 0 != eval1_~tmp___1~0#1; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {6010#false} assume !(0 == ~p_dw_st~0); {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {6010#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; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {6010#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; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {6010#false} assume 0 == ~c_dr_pc~0; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {6010#false} assume !false; {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {6010#false} assume !(1 == ~q_free~0); {6010#false} is VALID [2022-02-20 19:57:13,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {6010#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; {6010#false} is VALID [2022-02-20 19:57:13,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {6010#false} assume !(~p_last_write~0 == ~c_last_read~0); {6010#false} is VALID [2022-02-20 19:57:13,313 INFO L272 TraceCheckUtils]: 63: Hoare triple {6010#false} call error1(); {6010#false} is VALID [2022-02-20 19:57:13,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {6010#false} assume !false; {6010#false} is VALID [2022-02-20 19:57:13,313 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 19:57:13,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999355077] [2022-02-20 19:57:13,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999355077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:57:13,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147818808] [2022-02-20 19:57:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,315 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), 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 65 [2022-02-20 19:57:13,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,315 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), 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 19:57:13,349 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 19:57:13,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:13,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:13,350 INFO L87 Difference]: Start difference. First operand 522 states and 759 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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 19:57:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,284 INFO L93 Difference]: Finished difference Result 1854 states and 2605 transitions. [2022-02-20 19:57:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:18,284 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), 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 65 [2022-02-20 19:57:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:18,285 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), 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 19:57:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1174 transitions. [2022-02-20 19:57:18,293 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), 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 19:57:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1174 transitions. [2022-02-20 19:57:18,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1174 transitions. [2022-02-20 19:57:19,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1174 edges. 1174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:19,223 INFO L225 Difference]: With dead ends: 1854 [2022-02-20 19:57:19,223 INFO L226 Difference]: Without dead ends: 1569 [2022-02-20 19:57:19,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:57:19,226 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 2582 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:19,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2596 Valid, 2216 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:57:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-02-20 19:57:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1408. [2022-02-20 19:57:19,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:19,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1569 states. Second operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:19,274 INFO L74 IsIncluded]: Start isIncluded. First operand 1569 states. Second operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:19,276 INFO L87 Difference]: Start difference. First operand 1569 states. Second operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,360 INFO L93 Difference]: Finished difference Result 1569 states and 2092 transitions. [2022-02-20 19:57:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2092 transitions. [2022-02-20 19:57:19,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:19,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:19,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1569 states. [2022-02-20 19:57:19,367 INFO L87 Difference]: Start difference. First operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1569 states. [2022-02-20 19:57:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,459 INFO L93 Difference]: Finished difference Result 1569 states and 2092 transitions. [2022-02-20 19:57:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2092 transitions. [2022-02-20 19:57:19,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:19,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:19,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:19,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1134 states have (on average 1.3835978835978835) internal successors, (1569), 1158 states have internal predecessors, (1569), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1893 transitions. [2022-02-20 19:57:19,561 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1893 transitions. Word has length 65 [2022-02-20 19:57:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:19,561 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 1893 transitions. [2022-02-20 19:57:19,562 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), 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 19:57:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1893 transitions. [2022-02-20 19:57:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:19,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:19,565 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 19:57:19,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:19,565 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 689783590, now seen corresponding path program 1 times [2022-02-20 19:57:19,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:19,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269307933] [2022-02-20 19:57:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {13712#(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); {13673#true} is VALID [2022-02-20 19:57:19,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13673#true} {13673#true} #1241#return; {13673#true} is VALID [2022-02-20 19:57:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {13713#(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); {13673#true} is VALID [2022-02-20 19:57:19,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume !(0 == ~q_write_ev~0); {13673#true} is VALID [2022-02-20 19:57:19,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13673#true} {13673#true} #1243#return; {13673#true} is VALID [2022-02-20 19:57:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#true} havoc ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume !(1 == ~p_dw_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} ~__retres1~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {13673#true} #res := ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,677 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13673#true} {13673#true} #1237#return; {13673#true} is VALID [2022-02-20 19:57:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#true} havoc ~__retres1~1; {13673#true} is VALID [2022-02-20 19:57:19,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume !(1 == ~c_dr_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} ~__retres1~1 := 0; {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:19,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,708 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13673#true} #1239#return; {13727#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:19,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {13714#(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; {13673#true} is VALID [2022-02-20 19:57:19,708 INFO L272 TraceCheckUtils]: 1: Hoare triple {13673#true} call #t~ret8 := is_do_write_p_triggered(); {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} havoc ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {13673#true} assume !(1 == ~p_dw_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {13673#true} ~__retres1~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {13673#true} #res := ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13673#true} {13673#true} #1237#return; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {13673#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {13673#true} assume !(0 != ~tmp~1); {13673#true} is VALID [2022-02-20 19:57:19,709 INFO L272 TraceCheckUtils]: 10: Hoare triple {13673#true} call #t~ret9 := is_do_read_c_triggered(); {13673#true} is VALID [2022-02-20 19:57:19,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {13673#true} havoc ~__retres1~1; {13673#true} is VALID [2022-02-20 19:57:19,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {13673#true} assume !(1 == ~c_dr_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {13673#true} ~__retres1~1 := 0; {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:19,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13673#true} #1239#return; {13727#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:19,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {13727#(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; {13728#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:19,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {13728#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13674#false} is VALID [2022-02-20 19:57:19,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {13674#false} assume true; {13674#false} is VALID [2022-02-20 19:57:19,713 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13674#false} {13673#true} #1245#return; {13674#false} is VALID [2022-02-20 19:57:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {13713#(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); {13673#true} is VALID [2022-02-20 19:57:19,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13673#true} is VALID [2022-02-20 19:57:19,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13673#true} {13674#false} #1247#return; {13674#false} is VALID [2022-02-20 19:57:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#true} havoc ~__retres1~2; {13673#true} is VALID [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13673#true} is VALID [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} #res := ~__retres1~2; {13673#true} is VALID [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,719 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13673#true} {13674#false} #1249#return; {13674#false} is VALID [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {13673#true} is VALID [2022-02-20 19:57:19,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {13673#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {13673#true} is VALID [2022-02-20 19:57:19,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {13673#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13673#true} is VALID [2022-02-20 19:57:19,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {13673#true} call update_channels1(); {13712#(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 19:57:19,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {13712#(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); {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13673#true} {13673#true} #1241#return; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {13673#true} assume { :begin_inline_init_threads1 } true; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {13673#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {13673#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {13673#true} assume { :end_inline_init_threads1 } true; {13673#true} is VALID [2022-02-20 19:57:19,721 INFO L272 TraceCheckUtils]: 12: Hoare triple {13673#true} call fire_delta_events1(); {13713#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:19,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {13713#(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); {13673#true} is VALID [2022-02-20 19:57:19,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {13673#true} assume !(0 == ~q_write_ev~0); {13673#true} is VALID [2022-02-20 19:57:19,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,722 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13673#true} {13673#true} #1243#return; {13673#true} is VALID [2022-02-20 19:57:19,722 INFO L272 TraceCheckUtils]: 17: Hoare triple {13673#true} call activate_threads1(); {13714#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:19,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {13714#(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; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L272 TraceCheckUtils]: 19: Hoare triple {13673#true} call #t~ret8 := is_do_write_p_triggered(); {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {13673#true} havoc ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {13673#true} assume !(1 == ~p_dw_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {13673#true} ~__retres1~0 := 0; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {13673#true} #res := ~__retres1~0; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13673#true} {13673#true} #1237#return; {13673#true} is VALID [2022-02-20 19:57:19,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {13673#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13673#true} is VALID [2022-02-20 19:57:19,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {13673#true} assume !(0 != ~tmp~1); {13673#true} is VALID [2022-02-20 19:57:19,724 INFO L272 TraceCheckUtils]: 28: Hoare triple {13673#true} call #t~ret9 := is_do_read_c_triggered(); {13673#true} is VALID [2022-02-20 19:57:19,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {13673#true} havoc ~__retres1~1; {13673#true} is VALID [2022-02-20 19:57:19,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {13673#true} assume !(1 == ~c_dr_pc~0); {13673#true} is VALID [2022-02-20 19:57:19,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {13673#true} ~__retres1~1 := 0; {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:19,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {13729#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:19,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13730#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13673#true} #1239#return; {13727#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:19,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {13727#(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; {13728#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:19,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {13728#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13674#false} is VALID [2022-02-20 19:57:19,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {13674#false} assume true; {13674#false} is VALID [2022-02-20 19:57:19,727 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13674#false} {13673#true} #1245#return; {13674#false} is VALID [2022-02-20 19:57:19,727 INFO L272 TraceCheckUtils]: 39: Hoare triple {13674#false} call reset_delta_events1(); {13713#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:19,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {13713#(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); {13673#true} is VALID [2022-02-20 19:57:19,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {13673#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13673#true} is VALID [2022-02-20 19:57:19,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,727 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13673#true} {13674#false} #1247#return; {13674#false} is VALID [2022-02-20 19:57:19,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {13674#false} assume !false; {13674#false} is VALID [2022-02-20 19:57:19,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {13674#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; {13674#false} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {13674#false} assume !false; {13674#false} is VALID [2022-02-20 19:57:19,728 INFO L272 TraceCheckUtils]: 47: Hoare triple {13674#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13673#true} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {13673#true} havoc ~__retres1~2; {13673#true} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {13673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13673#true} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {13673#true} #res := ~__retres1~2; {13673#true} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {13673#true} assume true; {13673#true} is VALID [2022-02-20 19:57:19,728 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13673#true} {13674#false} #1249#return; {13674#false} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {13674#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; {13674#false} is VALID [2022-02-20 19:57:19,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {13674#false} assume 0 != eval1_~tmp___1~0#1; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {13674#false} assume !(0 == ~p_dw_st~0); {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {13674#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; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {13674#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; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {13674#false} assume 0 == ~c_dr_pc~0; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {13674#false} assume !false; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {13674#false} assume !(1 == ~q_free~0); {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {13674#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; {13674#false} is VALID [2022-02-20 19:57:19,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {13674#false} assume !(~p_last_write~0 == ~c_last_read~0); {13674#false} is VALID [2022-02-20 19:57:19,730 INFO L272 TraceCheckUtils]: 63: Hoare triple {13674#false} call error1(); {13674#false} is VALID [2022-02-20 19:57:19,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {13674#false} assume !false; {13674#false} is VALID [2022-02-20 19:57:19,730 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 19:57:19,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:19,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269307933] [2022-02-20 19:57:19,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269307933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:19,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:19,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:19,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952445463] [2022-02-20 19:57:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:19,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:19,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:19,765 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 19:57:19,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:19,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:19,766 INFO L87 Difference]: Start difference. First operand 1408 states and 1893 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,684 INFO L93 Difference]: Finished difference Result 2737 states and 3643 transitions. [2022-02-20 19:57:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 649 transitions. [2022-02-20 19:57:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 649 transitions. [2022-02-20 19:57:22,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 649 transitions. [2022-02-20 19:57:23,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:23,209 INFO L225 Difference]: With dead ends: 2737 [2022-02-20 19:57:23,209 INFO L226 Difference]: Without dead ends: 1572 [2022-02-20 19:57:23,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:23,219 INFO L933 BasicCegarLoop]: 480 mSDtfsCounter, 406 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:23,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 2168 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-02-20 19:57:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1438. [2022-02-20 19:57:23,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:23,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1572 states. Second operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:23,281 INFO L74 IsIncluded]: Start isIncluded. First operand 1572 states. Second operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:23,283 INFO L87 Difference]: Start difference. First operand 1572 states. Second operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,377 INFO L93 Difference]: Finished difference Result 1572 states and 2083 transitions. [2022-02-20 19:57:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2083 transitions. [2022-02-20 19:57:23,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1572 states. [2022-02-20 19:57:23,396 INFO L87 Difference]: Start difference. First operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1572 states. [2022-02-20 19:57:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,477 INFO L93 Difference]: Finished difference Result 1572 states and 2083 transitions. [2022-02-20 19:57:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2083 transitions. [2022-02-20 19:57:23,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:23,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1158 states have (on average 1.3687392055267702) internal successors, (1585), 1182 states have internal predecessors, (1585), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1915 transitions. [2022-02-20 19:57:23,576 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1915 transitions. Word has length 65 [2022-02-20 19:57:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:23,577 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 1915 transitions. [2022-02-20 19:57:23,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1915 transitions. [2022-02-20 19:57:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:23,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:23,578 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 19:57:23,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:23,578 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2075986984, now seen corresponding path program 1 times [2022-02-20 19:57:23,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:23,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863214590] [2022-02-20 19:57:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {22548#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1241#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {22549#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {22549#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1243#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#true} havoc ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#true} assume !(1 == ~p_dw_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {22508#true} ~__retres1~0 := 0; {22508#true} is VALID [2022-02-20 19:57:23,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {22508#true} #res := ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,659 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22508#true} {22508#true} #1237#return; {22508#true} is VALID [2022-02-20 19:57:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#true} havoc ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#true} assume !(1 == ~c_dr_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {22508#true} ~__retres1~1 := 0; {22508#true} is VALID [2022-02-20 19:57:23,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {22508#true} #res := ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,661 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22508#true} {22508#true} #1239#return; {22508#true} is VALID [2022-02-20 19:57:23,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {22550#(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; {22508#true} is VALID [2022-02-20 19:57:23,662 INFO L272 TraceCheckUtils]: 1: Hoare triple {22508#true} call #t~ret8 := is_do_write_p_triggered(); {22508#true} is VALID [2022-02-20 19:57:23,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {22508#true} havoc ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {22508#true} assume !(1 == ~p_dw_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {22508#true} ~__retres1~0 := 0; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {22508#true} #res := ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22508#true} {22508#true} #1237#return; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {22508#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {22508#true} assume !(0 != ~tmp~1); {22508#true} is VALID [2022-02-20 19:57:23,663 INFO L272 TraceCheckUtils]: 10: Hoare triple {22508#true} call #t~ret9 := is_do_read_c_triggered(); {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {22508#true} havoc ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {22508#true} assume !(1 == ~c_dr_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {22508#true} ~__retres1~1 := 0; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {22508#true} #res := ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22508#true} {22508#true} #1239#return; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {22508#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22508#true} is VALID [2022-02-20 19:57:23,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {22508#true} assume !(0 != ~tmp___0~1); {22508#true} is VALID [2022-02-20 19:57:23,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,665 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22508#true} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1245#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {22549#(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); {22563#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:23,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {22563#(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; {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:23,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:23,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1247#return; {22509#false} is VALID [2022-02-20 19:57:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#true} havoc ~__retres1~2; {22508#true} is VALID [2022-02-20 19:57:23,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22508#true} is VALID [2022-02-20 19:57:23,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {22508#true} #res := ~__retres1~2; {22508#true} is VALID [2022-02-20 19:57:23,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,690 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22508#true} {22509#false} #1249#return; {22509#false} is VALID [2022-02-20 19:57:23,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22508#true} is VALID [2022-02-20 19:57:23,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {22508#true} is VALID [2022-02-20 19:57:23,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {22508#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {22510#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22548#(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 19:57:23,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {22548#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,695 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1241#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,697 INFO L272 TraceCheckUtils]: 12: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {22549#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {22549#(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); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,698 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1243#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,699 INFO L272 TraceCheckUtils]: 17: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {22550#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:23,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {22550#(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; {22508#true} is VALID [2022-02-20 19:57:23,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {22508#true} call #t~ret8 := is_do_write_p_triggered(); {22508#true} is VALID [2022-02-20 19:57:23,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {22508#true} havoc ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {22508#true} assume !(1 == ~p_dw_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {22508#true} ~__retres1~0 := 0; {22508#true} is VALID [2022-02-20 19:57:23,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {22508#true} #res := ~__retres1~0; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22508#true} {22508#true} #1237#return; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {22508#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {22508#true} assume !(0 != ~tmp~1); {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L272 TraceCheckUtils]: 28: Hoare triple {22508#true} call #t~ret9 := is_do_read_c_triggered(); {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {22508#true} havoc ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {22508#true} assume !(1 == ~c_dr_pc~0); {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {22508#true} ~__retres1~1 := 0; {22508#true} is VALID [2022-02-20 19:57:23,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {22508#true} #res := ~__retres1~1; {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22508#true} {22508#true} #1239#return; {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {22508#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {22508#true} assume !(0 != ~tmp___0~1); {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,701 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22508#true} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1245#return; {22510#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:23,702 INFO L272 TraceCheckUtils]: 39: Hoare triple {22510#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {22549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {22549#(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); {22563#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:23,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {22563#(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; {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:23,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:23,703 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22564#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22510#(= ~q_write_ev~0 ~q_read_ev~0)} #1247#return; {22509#false} is VALID [2022-02-20 19:57:23,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {22509#false} assume !false; {22509#false} is VALID [2022-02-20 19:57:23,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {22509#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; {22509#false} is VALID [2022-02-20 19:57:23,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {22509#false} assume !false; {22509#false} is VALID [2022-02-20 19:57:23,703 INFO L272 TraceCheckUtils]: 47: Hoare triple {22509#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22508#true} is VALID [2022-02-20 19:57:23,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {22508#true} havoc ~__retres1~2; {22508#true} is VALID [2022-02-20 19:57:23,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {22508#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22508#true} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {22508#true} #res := ~__retres1~2; {22508#true} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {22508#true} assume true; {22508#true} is VALID [2022-02-20 19:57:23,704 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22508#true} {22509#false} #1249#return; {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {22509#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; {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {22509#false} assume 0 != eval1_~tmp___1~0#1; {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {22509#false} assume !(0 == ~p_dw_st~0); {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {22509#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; {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {22509#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; {22509#false} is VALID [2022-02-20 19:57:23,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {22509#false} assume 0 == ~c_dr_pc~0; {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {22509#false} assume !false; {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {22509#false} assume !(1 == ~q_free~0); {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {22509#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; {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {22509#false} assume !(~p_last_write~0 == ~c_last_read~0); {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L272 TraceCheckUtils]: 63: Hoare triple {22509#false} call error1(); {22509#false} is VALID [2022-02-20 19:57:23,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {22509#false} assume !false; {22509#false} is VALID [2022-02-20 19:57:23,705 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 19:57:23,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:23,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863214590] [2022-02-20 19:57:23,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863214590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:23,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:23,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:23,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454219442] [2022-02-20 19:57:23,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:23,707 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 19:57:23,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:23,707 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 19:57:23,737 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 19:57:23,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:23,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:23,738 INFO L87 Difference]: Start difference. First operand 1438 states and 1915 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 19:57:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:26,618 INFO L93 Difference]: Finished difference Result 2787 states and 3617 transitions. [2022-02-20 19:57:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 19:57:26,619 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 19:57:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:26,619 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 19:57:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 834 transitions. [2022-02-20 19:57:26,625 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 19:57:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 834 transitions. [2022-02-20 19:57:26,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 834 transitions. [2022-02-20 19:57:27,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 834 edges. 834 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:27,301 INFO L225 Difference]: With dead ends: 2787 [2022-02-20 19:57:27,301 INFO L226 Difference]: Without dead ends: 1815 [2022-02-20 19:57:27,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:57:27,303 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 973 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:27,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 1688 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2022-02-20 19:57:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1380. [2022-02-20 19:57:27,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:27,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1815 states. Second operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:27,354 INFO L74 IsIncluded]: Start isIncluded. First operand 1815 states. Second operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:27,355 INFO L87 Difference]: Start difference. First operand 1815 states. Second operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,458 INFO L93 Difference]: Finished difference Result 1815 states and 2343 transitions. [2022-02-20 19:57:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2343 transitions. [2022-02-20 19:57:27,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1815 states. [2022-02-20 19:57:27,466 INFO L87 Difference]: Start difference. First operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1815 states. [2022-02-20 19:57:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,579 INFO L93 Difference]: Finished difference Result 1815 states and 2343 transitions. [2022-02-20 19:57:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2343 transitions. [2022-02-20 19:57:27,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:27,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1116 states have (on average 1.3664874551971327) internal successors, (1525), 1135 states have internal predecessors, (1525), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1834 transitions. [2022-02-20 19:57:27,669 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1834 transitions. Word has length 65 [2022-02-20 19:57:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:27,669 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 1834 transitions. [2022-02-20 19:57:27,669 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 19:57:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1834 transitions. [2022-02-20 19:57:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:27,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:27,670 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 19:57:27,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:27,671 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1941973478, now seen corresponding path program 1 times [2022-02-20 19:57:27,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:27,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56072917] [2022-02-20 19:57:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {31826#(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); {31786#true} is VALID [2022-02-20 19:57:27,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31786#true} {31786#true} #1241#return; {31786#true} is VALID [2022-02-20 19:57:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {31827#(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); {31786#true} is VALID [2022-02-20 19:57:27,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume !(0 == ~q_write_ev~0); {31786#true} is VALID [2022-02-20 19:57:27,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31786#true} {31791#(= ~p_dw_st~0 0)} #1243#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {31786#true} havoc ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume !(1 == ~p_dw_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} ~__retres1~0 := 0; {31786#true} is VALID [2022-02-20 19:57:27,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {31786#true} #res := ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,731 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1237#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {31786#true} havoc ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume !(1 == ~c_dr_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} ~__retres1~1 := 0; {31786#true} is VALID [2022-02-20 19:57:27,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {31786#true} #res := ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,734 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1239#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {31828#(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; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,735 INFO L272 TraceCheckUtils]: 1: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31786#true} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} havoc ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {31786#true} assume !(1 == ~p_dw_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {31786#true} ~__retres1~0 := 0; {31786#true} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {31786#true} #res := ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,736 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1237#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,737 INFO L272 TraceCheckUtils]: 10: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {31786#true} havoc ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {31786#true} assume !(1 == ~c_dr_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {31786#true} ~__retres1~1 := 0; {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {31786#true} #res := ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,737 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1239#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,739 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31791#(= ~p_dw_st~0 0)} #1245#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {31827#(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); {31786#true} is VALID [2022-02-20 19:57:27,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume !(1 == ~q_write_ev~0); {31786#true} is VALID [2022-02-20 19:57:27,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31786#true} {31791#(= ~p_dw_st~0 0)} #1247#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {31786#true} havoc ~__retres1~2; {31786#true} is VALID [2022-02-20 19:57:27,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {31791#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {31791#(= ~p_dw_st~0 0)} assume true; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,748 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31791#(= ~p_dw_st~0 0)} {31791#(= ~p_dw_st~0 0)} #1249#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {31786#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {31786#true} is VALID [2022-02-20 19:57:27,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {31786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {31786#true} is VALID [2022-02-20 19:57:27,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {31786#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {31786#true} is VALID [2022-02-20 19:57:27,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {31786#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {31786#true} is VALID [2022-02-20 19:57:27,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {31786#true} call update_channels1(); {31826#(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 19:57:27,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {31826#(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); {31786#true} is VALID [2022-02-20 19:57:27,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,750 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31786#true} {31786#true} #1241#return; {31786#true} is VALID [2022-02-20 19:57:27,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {31786#true} assume { :begin_inline_init_threads1 } true; {31786#true} is VALID [2022-02-20 19:57:27,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {31786#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {31791#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {31791#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,753 INFO L272 TraceCheckUtils]: 12: Hoare triple {31791#(= ~p_dw_st~0 0)} call fire_delta_events1(); {31827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:27,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {31827#(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); {31786#true} is VALID [2022-02-20 19:57:27,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {31786#true} assume !(0 == ~q_write_ev~0); {31786#true} is VALID [2022-02-20 19:57:27,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,753 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31786#true} {31791#(= ~p_dw_st~0 0)} #1243#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,754 INFO L272 TraceCheckUtils]: 17: Hoare triple {31791#(= ~p_dw_st~0 0)} call activate_threads1(); {31828#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:27,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {31828#(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; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,754 INFO L272 TraceCheckUtils]: 19: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31786#true} is VALID [2022-02-20 19:57:27,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {31786#true} havoc ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {31786#true} assume !(1 == ~p_dw_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {31786#true} ~__retres1~0 := 0; {31786#true} is VALID [2022-02-20 19:57:27,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {31786#true} #res := ~__retres1~0; {31786#true} is VALID [2022-02-20 19:57:27,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,755 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1237#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31786#true} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {31786#true} havoc ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {31786#true} assume !(1 == ~c_dr_pc~0); {31786#true} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {31786#true} ~__retres1~1 := 0; {31786#true} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {31786#true} #res := ~__retres1~1; {31786#true} is VALID [2022-02-20 19:57:27,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,757 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {31786#true} {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1239#return; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:27,758 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31829#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31791#(= ~p_dw_st~0 0)} #1245#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,758 INFO L272 TraceCheckUtils]: 39: Hoare triple {31791#(= ~p_dw_st~0 0)} call reset_delta_events1(); {31827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:27,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {31827#(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); {31786#true} is VALID [2022-02-20 19:57:27,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {31786#true} assume !(1 == ~q_write_ev~0); {31786#true} is VALID [2022-02-20 19:57:27,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {31786#true} assume true; {31786#true} is VALID [2022-02-20 19:57:27,759 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {31786#true} {31791#(= ~p_dw_st~0 0)} #1247#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {31791#(= ~p_dw_st~0 0)} assume !false; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {31791#(= ~p_dw_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; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {31791#(= ~p_dw_st~0 0)} assume !false; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,760 INFO L272 TraceCheckUtils]: 47: Hoare triple {31791#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {31786#true} is VALID [2022-02-20 19:57:27,760 INFO L290 TraceCheckUtils]: 48: Hoare triple {31786#true} havoc ~__retres1~2; {31786#true} is VALID [2022-02-20 19:57:27,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {31786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {31791#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {31791#(= ~p_dw_st~0 0)} assume true; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,761 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31791#(= ~p_dw_st~0 0)} {31791#(= ~p_dw_st~0 0)} #1249#return; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {31791#(= ~p_dw_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; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {31791#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {31791#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:27,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {31791#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {31787#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; {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {31787#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; {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {31787#false} assume 0 == ~c_dr_pc~0; {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {31787#false} assume !false; {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {31787#false} assume !(1 == ~q_free~0); {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {31787#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; {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {31787#false} assume !(~p_last_write~0 == ~c_last_read~0); {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L272 TraceCheckUtils]: 63: Hoare triple {31787#false} call error1(); {31787#false} is VALID [2022-02-20 19:57:27,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {31787#false} assume !false; {31787#false} is VALID [2022-02-20 19:57:27,763 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 19:57:27,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:27,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56072917] [2022-02-20 19:57:27,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56072917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:27,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:27,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:27,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240354563] [2022-02-20 19:57:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:27,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:27,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:27,800 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 19:57:27,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:27,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:27,801 INFO L87 Difference]: Start difference. First operand 1380 states and 1834 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:29,929 INFO L93 Difference]: Finished difference Result 3734 states and 4852 transitions. [2022-02-20 19:57:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 767 transitions. [2022-02-20 19:57:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 767 transitions. [2022-02-20 19:57:29,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 767 transitions. [2022-02-20 19:57:30,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 767 edges. 767 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:30,672 INFO L225 Difference]: With dead ends: 3734 [2022-02-20 19:57:30,672 INFO L226 Difference]: Without dead ends: 2598 [2022-02-20 19:57:30,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:30,675 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 926 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:30,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 1406 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-02-20 19:57:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2478. [2022-02-20 19:57:30,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:30,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2598 states. Second operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:30,767 INFO L74 IsIncluded]: Start isIncluded. First operand 2598 states. Second operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:30,769 INFO L87 Difference]: Start difference. First operand 2598 states. Second operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,973 INFO L93 Difference]: Finished difference Result 2598 states and 3335 transitions. [2022-02-20 19:57:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3335 transitions. [2022-02-20 19:57:30,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) Second operand 2598 states. [2022-02-20 19:57:30,984 INFO L87 Difference]: Start difference. First operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) Second operand 2598 states. [2022-02-20 19:57:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:31,207 INFO L93 Difference]: Finished difference Result 2598 states and 3335 transitions. [2022-02-20 19:57:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3335 transitions. [2022-02-20 19:57:31,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:31,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:31,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:31,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 1955 states have (on average 1.3048593350383633) internal successors, (2551), 1998 states have internal predecessors, (2551), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3202 transitions. [2022-02-20 19:57:31,491 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3202 transitions. Word has length 65 [2022-02-20 19:57:31,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:31,492 INFO L470 AbstractCegarLoop]: Abstraction has 2478 states and 3202 transitions. [2022-02-20 19:57:31,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3202 transitions. [2022-02-20 19:57:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:31,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:31,493 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 19:57:31,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:31,493 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 754580266, now seen corresponding path program 1 times [2022-02-20 19:57:31,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:31,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796100998] [2022-02-20 19:57:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {45454#(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); {45414#true} is VALID [2022-02-20 19:57:31,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1241#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {45455#(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); {45414#true} is VALID [2022-02-20 19:57:31,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume !(0 == ~q_write_ev~0); {45414#true} is VALID [2022-02-20 19:57:31,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1243#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {45414#true} havoc ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume !(1 == ~p_dw_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} ~__retres1~0 := 0; {45414#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {45414#true} #res := ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,572 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45414#true} {45414#true} #1237#return; {45414#true} is VALID [2022-02-20 19:57:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {45414#true} havoc ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume !(1 == ~c_dr_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} ~__retres1~1 := 0; {45414#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {45414#true} #res := ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,576 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45414#true} {45414#true} #1239#return; {45414#true} is VALID [2022-02-20 19:57:31,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {45456#(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; {45414#true} is VALID [2022-02-20 19:57:31,576 INFO L272 TraceCheckUtils]: 1: Hoare triple {45414#true} call #t~ret8 := is_do_write_p_triggered(); {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} havoc ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {45414#true} assume !(1 == ~p_dw_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {45414#true} ~__retres1~0 := 0; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {45414#true} #res := ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45414#true} {45414#true} #1237#return; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {45414#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {45414#true} assume !(0 != ~tmp~1); {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L272 TraceCheckUtils]: 10: Hoare triple {45414#true} call #t~ret9 := is_do_read_c_triggered(); {45414#true} is VALID [2022-02-20 19:57:31,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {45414#true} havoc ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {45414#true} assume !(1 == ~c_dr_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {45414#true} ~__retres1~1 := 0; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {45414#true} #res := ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45414#true} {45414#true} #1239#return; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {45414#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {45414#true} assume !(0 != ~tmp___0~1); {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,588 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1245#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {45455#(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); {45414#true} is VALID [2022-02-20 19:57:31,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume !(1 == ~q_write_ev~0); {45414#true} is VALID [2022-02-20 19:57:31,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1247#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {45414#true} havoc ~__retres1~2; {45414#true} is VALID [2022-02-20 19:57:31,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45414#true} is VALID [2022-02-20 19:57:31,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} #res := ~__retres1~2; {45414#true} is VALID [2022-02-20 19:57:31,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,601 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1249#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {45414#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {45414#true} is VALID [2022-02-20 19:57:31,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {45414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {45414#true} is VALID [2022-02-20 19:57:31,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {45414#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {45416#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {45416#(= ~q_free~0 1)} call update_channels1(); {45454#(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 19:57:31,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {45454#(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); {45414#true} is VALID [2022-02-20 19:57:31,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,603 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1241#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {45416#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {45416#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {45416#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {45416#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {45416#(= ~q_free~0 1)} call fire_delta_events1(); {45455#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:31,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {45455#(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); {45414#true} is VALID [2022-02-20 19:57:31,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {45414#true} assume !(0 == ~q_write_ev~0); {45414#true} is VALID [2022-02-20 19:57:31,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1243#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,605 INFO L272 TraceCheckUtils]: 17: Hoare triple {45416#(= ~q_free~0 1)} call activate_threads1(); {45456#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:31,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {45456#(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; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L272 TraceCheckUtils]: 19: Hoare triple {45414#true} call #t~ret8 := is_do_write_p_triggered(); {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {45414#true} havoc ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {45414#true} assume !(1 == ~p_dw_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {45414#true} ~__retres1~0 := 0; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {45414#true} #res := ~__retres1~0; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45414#true} {45414#true} #1237#return; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {45414#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {45414#true} assume !(0 != ~tmp~1); {45414#true} is VALID [2022-02-20 19:57:31,606 INFO L272 TraceCheckUtils]: 28: Hoare triple {45414#true} call #t~ret9 := is_do_read_c_triggered(); {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {45414#true} havoc ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {45414#true} assume !(1 == ~c_dr_pc~0); {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {45414#true} ~__retres1~1 := 0; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {45414#true} #res := ~__retres1~1; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45414#true} {45414#true} #1239#return; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {45414#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {45414#true} assume !(0 != ~tmp___0~1); {45414#true} is VALID [2022-02-20 19:57:31,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,608 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1245#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,608 INFO L272 TraceCheckUtils]: 39: Hoare triple {45416#(= ~q_free~0 1)} call reset_delta_events1(); {45455#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:31,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {45455#(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); {45414#true} is VALID [2022-02-20 19:57:31,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {45414#true} assume !(1 == ~q_write_ev~0); {45414#true} is VALID [2022-02-20 19:57:31,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,609 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1247#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {45416#(= ~q_free~0 1)} assume !false; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {45416#(= ~q_free~0 1)} 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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {45416#(= ~q_free~0 1)} assume !false; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,610 INFO L272 TraceCheckUtils]: 47: Hoare triple {45416#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45414#true} is VALID [2022-02-20 19:57:31,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {45414#true} havoc ~__retres1~2; {45414#true} is VALID [2022-02-20 19:57:31,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {45414#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45414#true} is VALID [2022-02-20 19:57:31,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {45414#true} #res := ~__retres1~2; {45414#true} is VALID [2022-02-20 19:57:31,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {45414#true} assume true; {45414#true} is VALID [2022-02-20 19:57:31,610 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45414#true} {45416#(= ~q_free~0 1)} #1249#return; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {45416#(= ~q_free~0 1)} 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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {45416#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {45416#(= ~q_free~0 1)} 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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {45416#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {45416#(= ~q_free~0 1)} 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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {45416#(= ~q_free~0 1)} 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; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {45416#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {45416#(= ~q_free~0 1)} assume !false; {45416#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:31,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {45416#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45415#false} is VALID [2022-02-20 19:57:31,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {45415#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; {45415#false} is VALID [2022-02-20 19:57:31,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {45415#false} assume !(~p_last_write~0 == ~c_last_read~0); {45415#false} is VALID [2022-02-20 19:57:31,613 INFO L272 TraceCheckUtils]: 64: Hoare triple {45415#false} call error1(); {45415#false} is VALID [2022-02-20 19:57:31,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {45415#false} assume !false; {45415#false} is VALID [2022-02-20 19:57:31,614 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 19:57:31,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:31,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796100998] [2022-02-20 19:57:31,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796100998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:31,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:31,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:31,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263018368] [2022-02-20 19:57:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:31,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:31,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:31,645 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 19:57:31,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:31,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:31,647 INFO L87 Difference]: Start difference. First operand 2478 states and 3202 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:34,495 INFO L93 Difference]: Finished difference Result 5872 states and 7510 transitions. [2022-02-20 19:57:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:34,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2022-02-20 19:57:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2022-02-20 19:57:34,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 757 transitions. [2022-02-20 19:57:34,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:35,501 INFO L225 Difference]: With dead ends: 5872 [2022-02-20 19:57:35,502 INFO L226 Difference]: Without dead ends: 3643 [2022-02-20 19:57:35,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:35,505 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 816 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:35,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 1160 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2022-02-20 19:57:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3312. [2022-02-20 19:57:35,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:35,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3643 states. Second operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:35,636 INFO L74 IsIncluded]: Start isIncluded. First operand 3643 states. Second operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:35,640 INFO L87 Difference]: Start difference. First operand 3643 states. Second operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,083 INFO L93 Difference]: Finished difference Result 3643 states and 4622 transitions. [2022-02-20 19:57:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4622 transitions. [2022-02-20 19:57:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:36,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:36,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) Second operand 3643 states. [2022-02-20 19:57:36,099 INFO L87 Difference]: Start difference. First operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) Second operand 3643 states. [2022-02-20 19:57:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,545 INFO L93 Difference]: Finished difference Result 3643 states and 4622 transitions. [2022-02-20 19:57:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4622 transitions. [2022-02-20 19:57:36,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:36,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:36,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:36,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 2600 states have (on average 1.2896153846153846) internal successors, (3353), 2650 states have internal predecessors, (3353), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 4219 transitions. [2022-02-20 19:57:37,050 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 4219 transitions. Word has length 66 [2022-02-20 19:57:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:37,050 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 4219 transitions. [2022-02-20 19:57:37,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 4219 transitions. [2022-02-20 19:57:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:37,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:37,052 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:37,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:37,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash 575552873, now seen corresponding path program 1 times [2022-02-20 19:57:37,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:37,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427997271] [2022-02-20 19:57:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {65139#(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); {65099#true} is VALID [2022-02-20 19:57:37,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1241#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {65140#(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); {65099#true} is VALID [2022-02-20 19:57:37,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume !(0 == ~q_write_ev~0); {65099#true} is VALID [2022-02-20 19:57:37,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1243#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {65099#true} havoc ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume !(1 == ~p_dw_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} ~__retres1~0 := 0; {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {65099#true} #res := ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65099#true} {65099#true} #1237#return; {65099#true} is VALID [2022-02-20 19:57:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {65099#true} havoc ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume !(1 == ~c_dr_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} ~__retres1~1 := 0; {65099#true} is VALID [2022-02-20 19:57:37,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {65099#true} #res := ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,115 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65099#true} {65099#true} #1239#return; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {65141#(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; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L272 TraceCheckUtils]: 1: Hoare triple {65099#true} call #t~ret8 := is_do_write_p_triggered(); {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} havoc ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {65099#true} assume !(1 == ~p_dw_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {65099#true} ~__retres1~0 := 0; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {65099#true} #res := ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,116 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65099#true} {65099#true} #1237#return; {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {65099#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {65099#true} assume !(0 != ~tmp~1); {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L272 TraceCheckUtils]: 10: Hoare triple {65099#true} call #t~ret9 := is_do_read_c_triggered(); {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {65099#true} havoc ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {65099#true} assume !(1 == ~c_dr_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {65099#true} ~__retres1~1 := 0; {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {65099#true} #res := ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,118 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65099#true} {65099#true} #1239#return; {65099#true} is VALID [2022-02-20 19:57:37,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {65099#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65099#true} is VALID [2022-02-20 19:57:37,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {65099#true} assume !(0 != ~tmp___0~1); {65099#true} is VALID [2022-02-20 19:57:37,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,118 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1245#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {65140#(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); {65099#true} is VALID [2022-02-20 19:57:37,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume !(1 == ~q_write_ev~0); {65099#true} is VALID [2022-02-20 19:57:37,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1247#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:37,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {65099#true} havoc ~__retres1~2; {65099#true} is VALID [2022-02-20 19:57:37,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65099#true} is VALID [2022-02-20 19:57:37,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} #res := ~__retres1~2; {65099#true} is VALID [2022-02-20 19:57:37,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,127 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1249#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {65099#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {65099#true} is VALID [2022-02-20 19:57:37,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {65099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {65099#true} is VALID [2022-02-20 19:57:37,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {65099#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {65101#(= ~p_dw_pc~0 0)} call update_channels1(); {65139#(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 19:57:37,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {65139#(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); {65099#true} is VALID [2022-02-20 19:57:37,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,129 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1241#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,131 INFO L272 TraceCheckUtils]: 12: Hoare triple {65101#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {65140#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:37,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {65140#(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); {65099#true} is VALID [2022-02-20 19:57:37,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {65099#true} assume !(0 == ~q_write_ev~0); {65099#true} is VALID [2022-02-20 19:57:37,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,131 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1243#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,132 INFO L272 TraceCheckUtils]: 17: Hoare triple {65101#(= ~p_dw_pc~0 0)} call activate_threads1(); {65141#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:37,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {65141#(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; {65099#true} is VALID [2022-02-20 19:57:37,132 INFO L272 TraceCheckUtils]: 19: Hoare triple {65099#true} call #t~ret8 := is_do_write_p_triggered(); {65099#true} is VALID [2022-02-20 19:57:37,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {65099#true} havoc ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {65099#true} assume !(1 == ~p_dw_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {65099#true} ~__retres1~0 := 0; {65099#true} is VALID [2022-02-20 19:57:37,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {65099#true} #res := ~__retres1~0; {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65099#true} {65099#true} #1237#return; {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {65099#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {65099#true} assume !(0 != ~tmp~1); {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L272 TraceCheckUtils]: 28: Hoare triple {65099#true} call #t~ret9 := is_do_read_c_triggered(); {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {65099#true} havoc ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {65099#true} assume !(1 == ~c_dr_pc~0); {65099#true} is VALID [2022-02-20 19:57:37,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {65099#true} ~__retres1~1 := 0; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {65099#true} #res := ~__retres1~1; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {65099#true} {65099#true} #1239#return; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {65099#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {65099#true} assume !(0 != ~tmp___0~1); {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,134 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1245#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,135 INFO L272 TraceCheckUtils]: 39: Hoare triple {65101#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {65140#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:37,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {65140#(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); {65099#true} is VALID [2022-02-20 19:57:37,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {65099#true} assume !(1 == ~q_write_ev~0); {65099#true} is VALID [2022-02-20 19:57:37,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,136 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1247#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume !false; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {65101#(= ~p_dw_pc~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; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume !false; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,137 INFO L272 TraceCheckUtils]: 47: Hoare triple {65101#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65099#true} is VALID [2022-02-20 19:57:37,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {65099#true} havoc ~__retres1~2; {65099#true} is VALID [2022-02-20 19:57:37,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {65099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65099#true} is VALID [2022-02-20 19:57:37,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {65099#true} #res := ~__retres1~2; {65099#true} is VALID [2022-02-20 19:57:37,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {65099#true} assume true; {65099#true} is VALID [2022-02-20 19:57:37,137 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {65099#true} {65101#(= ~p_dw_pc~0 0)} #1249#return; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {65101#(= ~p_dw_pc~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; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {65101#(= ~p_dw_pc~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; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {65101#(= ~p_dw_pc~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; {65101#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:37,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {65101#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {65100#false} is VALID [2022-02-20 19:57:37,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {65100#false} assume 1 == ~p_dw_pc~0; {65100#false} is VALID [2022-02-20 19:57:37,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {65100#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; {65100#false} is VALID [2022-02-20 19:57:37,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {65100#false} assume !false; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {65100#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {65100#false} assume { :end_inline_do_write_p } true; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {65100#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; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {65100#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; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {65100#false} assume 0 == ~c_dr_pc~0; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {65100#false} assume !false; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {65100#false} assume !(1 == ~q_free~0); {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {65100#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; {65100#false} is VALID [2022-02-20 19:57:37,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {65100#false} assume !(~p_last_write~0 == ~c_last_read~0); {65100#false} is VALID [2022-02-20 19:57:37,141 INFO L272 TraceCheckUtils]: 70: Hoare triple {65100#false} call error1(); {65100#false} is VALID [2022-02-20 19:57:37,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {65100#false} assume !false; {65100#false} is VALID [2022-02-20 19:57:37,141 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 19:57:37,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:37,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427997271] [2022-02-20 19:57:37,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427997271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:37,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:37,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:37,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211324636] [2022-02-20 19:57:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:37,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:37,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:37,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:37,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:37,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:37,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:37,184 INFO L87 Difference]: Start difference. First operand 3312 states and 4219 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:40,833 INFO L93 Difference]: Finished difference Result 7298 states and 9218 transitions. [2022-02-20 19:57:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2022-02-20 19:57:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2022-02-20 19:57:40,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 760 transitions. [2022-02-20 19:57:41,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:42,066 INFO L225 Difference]: With dead ends: 7298 [2022-02-20 19:57:42,066 INFO L226 Difference]: Without dead ends: 4233 [2022-02-20 19:57:42,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:42,071 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 902 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:42,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [930 Valid, 1245 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2022-02-20 19:57:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3887. [2022-02-20 19:57:42,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:42,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4233 states. Second operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:42,218 INFO L74 IsIncluded]: Start isIncluded. First operand 4233 states. Second operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:42,222 INFO L87 Difference]: Start difference. First operand 4233 states. Second operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,770 INFO L93 Difference]: Finished difference Result 4233 states and 5348 transitions. [2022-02-20 19:57:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 5348 transitions. [2022-02-20 19:57:42,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:42,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:42,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) Second operand 4233 states. [2022-02-20 19:57:42,783 INFO L87 Difference]: Start difference. First operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) Second operand 4233 states. [2022-02-20 19:57:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,358 INFO L93 Difference]: Finished difference Result 4233 states and 5348 transitions. [2022-02-20 19:57:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 5348 transitions. [2022-02-20 19:57:43,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:43,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3887 states, 3055 states have (on average 1.2821603927986907) internal successors, (3917), 3109 states have internal predecessors, (3917), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 4924 transitions. [2022-02-20 19:57:44,053 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 4924 transitions. Word has length 72 [2022-02-20 19:57:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:44,053 INFO L470 AbstractCegarLoop]: Abstraction has 3887 states and 4924 transitions. [2022-02-20 19:57:44,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 4924 transitions. [2022-02-20 19:57:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:44,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:44,054 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:44,054 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash 145752580, now seen corresponding path program 1 times [2022-02-20 19:57:44,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:44,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732641967] [2022-02-20 19:57:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {88693#(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); {88652#true} is VALID [2022-02-20 19:57:44,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88652#true} {88652#true} #1241#return; {88652#true} is VALID [2022-02-20 19:57:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {88694#(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); {88652#true} is VALID [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume !(0 == ~q_write_ev~0); {88652#true} is VALID [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88652#true} {88652#true} #1243#return; {88652#true} is VALID [2022-02-20 19:57:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {88652#true} havoc ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume !(1 == ~p_dw_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} ~__retres1~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {88652#true} #res := ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {88652#true} {88652#true} #1237#return; {88652#true} is VALID [2022-02-20 19:57:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {88652#true} havoc ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume !(1 == ~c_dr_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} ~__retres1~1 := 0; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {88652#true} #res := ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {88652#true} {88652#true} #1239#return; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {88695#(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; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L272 TraceCheckUtils]: 1: Hoare triple {88652#true} call #t~ret8 := is_do_write_p_triggered(); {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} havoc ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {88652#true} assume !(1 == ~p_dw_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {88652#true} ~__retres1~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {88652#true} #res := ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {88652#true} {88652#true} #1237#return; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {88652#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {88652#true} assume !(0 != ~tmp~1); {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L272 TraceCheckUtils]: 10: Hoare triple {88652#true} call #t~ret9 := is_do_read_c_triggered(); {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {88652#true} havoc ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {88652#true} assume !(1 == ~c_dr_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {88652#true} ~__retres1~1 := 0; {88652#true} is VALID [2022-02-20 19:57:44,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {88652#true} #res := ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {88652#true} {88652#true} #1239#return; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {88652#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {88652#true} assume !(0 != ~tmp___0~1); {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {88652#true} {88652#true} #1245#return; {88652#true} is VALID [2022-02-20 19:57:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {88694#(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); {88652#true} is VALID [2022-02-20 19:57:44,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume !(1 == ~q_write_ev~0); {88652#true} is VALID [2022-02-20 19:57:44,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88652#true} {88652#true} #1247#return; {88652#true} is VALID [2022-02-20 19:57:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {88652#true} havoc ~__retres1~2; {88652#true} is VALID [2022-02-20 19:57:44,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88652#true} is VALID [2022-02-20 19:57:44,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} #res := ~__retres1~2; {88652#true} is VALID [2022-02-20 19:57:44,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,127 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {88652#true} {88652#true} #1249#return; {88652#true} is VALID [2022-02-20 19:57:44,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {88652#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {88652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {88652#true} is VALID [2022-02-20 19:57:44,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {88652#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {88652#true} is VALID [2022-02-20 19:57:44,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {88652#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {88652#true} is VALID [2022-02-20 19:57:44,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {88652#true} call update_channels1(); {88693#(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 19:57:44,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {88693#(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); {88652#true} is VALID [2022-02-20 19:57:44,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {88652#true} {88652#true} #1241#return; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {88652#true} assume { :begin_inline_init_threads1 } true; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {88652#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {88652#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {88652#true} assume { :end_inline_init_threads1 } true; {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L272 TraceCheckUtils]: 12: Hoare triple {88652#true} call fire_delta_events1(); {88694#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {88694#(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); {88652#true} is VALID [2022-02-20 19:57:44,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {88652#true} assume !(0 == ~q_write_ev~0); {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {88652#true} {88652#true} #1243#return; {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L272 TraceCheckUtils]: 17: Hoare triple {88652#true} call activate_threads1(); {88695#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:44,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {88695#(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; {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {88652#true} call #t~ret8 := is_do_write_p_triggered(); {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {88652#true} havoc ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {88652#true} assume !(1 == ~p_dw_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {88652#true} ~__retres1~0 := 0; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {88652#true} #res := ~__retres1~0; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {88652#true} {88652#true} #1237#return; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {88652#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {88652#true} assume !(0 != ~tmp~1); {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L272 TraceCheckUtils]: 28: Hoare triple {88652#true} call #t~ret9 := is_do_read_c_triggered(); {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {88652#true} havoc ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {88652#true} assume !(1 == ~c_dr_pc~0); {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {88652#true} ~__retres1~1 := 0; {88652#true} is VALID [2022-02-20 19:57:44,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {88652#true} #res := ~__retres1~1; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {88652#true} {88652#true} #1239#return; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {88652#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {88652#true} assume !(0 != ~tmp___0~1); {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {88652#true} {88652#true} #1245#return; {88652#true} is VALID [2022-02-20 19:57:44,132 INFO L272 TraceCheckUtils]: 39: Hoare triple {88652#true} call reset_delta_events1(); {88694#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:44,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {88694#(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); {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {88652#true} assume !(1 == ~q_write_ev~0); {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {88652#true} {88652#true} #1247#return; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {88652#true} assume !false; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {88652#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; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {88652#true} assume !false; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L272 TraceCheckUtils]: 47: Hoare triple {88652#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {88652#true} havoc ~__retres1~2; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {88652#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88652#true} is VALID [2022-02-20 19:57:44,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {88652#true} #res := ~__retres1~2; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {88652#true} assume true; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {88652#true} {88652#true} #1249#return; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {88652#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; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {88652#true} assume 0 != eval1_~tmp___1~0#1; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {88652#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; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {88652#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; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {88652#true} assume 0 == ~p_dw_pc~0; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {88652#true} assume !false; {88652#true} is VALID [2022-02-20 19:57:44,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {88652#true} assume !(0 == ~q_free~0); {88652#true} is VALID [2022-02-20 19:57:44,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {88652#true} 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; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_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; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} 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; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {88691#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:44,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {88691#(= ~p_last_write~0 ~q_buf_0~0)} 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; {88692#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:44,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {88692#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {88653#false} is VALID [2022-02-20 19:57:44,138 INFO L272 TraceCheckUtils]: 71: Hoare triple {88653#false} call error1(); {88653#false} is VALID [2022-02-20 19:57:44,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {88653#false} assume !false; {88653#false} is VALID [2022-02-20 19:57:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:44,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:44,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732641967] [2022-02-20 19:57:44,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732641967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:44,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:44,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:44,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393172679] [2022-02-20 19:57:44,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:44,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:44,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:44,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:44,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:44,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:44,176 INFO L87 Difference]: Start difference. First operand 3887 states and 4924 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,026 INFO L93 Difference]: Finished difference Result 5069 states and 6380 transitions. [2022-02-20 19:57:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:47,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 637 transitions. [2022-02-20 19:57:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 637 transitions. [2022-02-20 19:57:47,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 637 transitions. [2022-02-20 19:57:47,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:48,531 INFO L225 Difference]: With dead ends: 5069 [2022-02-20 19:57:48,532 INFO L226 Difference]: Without dead ends: 5066 [2022-02-20 19:57:48,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:48,533 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1378 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:48,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1387 Valid, 1215 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-02-20 19:57:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4354. [2022-02-20 19:57:48,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:48,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5066 states. Second operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:57:48,702 INFO L74 IsIncluded]: Start isIncluded. First operand 5066 states. Second operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:57:48,707 INFO L87 Difference]: Start difference. First operand 5066 states. Second operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:57:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:49,505 INFO L93 Difference]: Finished difference Result 5066 states and 6360 transitions. [2022-02-20 19:57:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 6360 transitions. [2022-02-20 19:57:49,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:49,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:49,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) Second operand 5066 states. [2022-02-20 19:57:49,521 INFO L87 Difference]: Start difference. First operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) Second operand 5066 states. [2022-02-20 19:57:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:50,313 INFO L93 Difference]: Finished difference Result 5066 states and 6360 transitions. [2022-02-20 19:57:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 6360 transitions. [2022-02-20 19:57:50,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:50,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:50,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:50,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4354 states, 3412 states have (on average 1.272860492379836) internal successors, (4343), 3470 states have internal predecessors, (4343), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:57:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 5485 transitions. [2022-02-20 19:57:51,234 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 5485 transitions. Word has length 73 [2022-02-20 19:57:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:51,235 INFO L470 AbstractCegarLoop]: Abstraction has 4354 states and 5485 transitions. [2022-02-20 19:57:51,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 5485 transitions. [2022-02-20 19:57:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:51,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:51,236 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:51,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:51,236 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 222341395, now seen corresponding path program 1 times [2022-02-20 19:57:51,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:51,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437601784] [2022-02-20 19:57:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {111504#(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); {111462#true} is VALID [2022-02-20 19:57:51,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1241#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {111505#(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); {111462#true} is VALID [2022-02-20 19:57:51,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume !(0 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:51,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1243#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#true} havoc ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume !(1 == ~p_dw_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} ~__retres1~0 := 0; {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {111462#true} #res := ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111462#true} {111462#true} #1237#return; {111462#true} is VALID [2022-02-20 19:57:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#true} havoc ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume !(1 == ~c_dr_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} ~__retres1~1 := 0; {111462#true} is VALID [2022-02-20 19:57:51,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {111462#true} #res := ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,356 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111462#true} {111462#true} #1239#return; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {111506#(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; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L272 TraceCheckUtils]: 1: Hoare triple {111462#true} call #t~ret8 := is_do_write_p_triggered(); {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} havoc ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {111462#true} assume !(1 == ~p_dw_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {111462#true} ~__retres1~0 := 0; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {111462#true} #res := ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111462#true} {111462#true} #1237#return; {111462#true} is VALID [2022-02-20 19:57:51,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {111462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {111462#true} assume !(0 != ~tmp~1); {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L272 TraceCheckUtils]: 10: Hoare triple {111462#true} call #t~ret9 := is_do_read_c_triggered(); {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {111462#true} havoc ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {111462#true} assume !(1 == ~c_dr_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {111462#true} ~__retres1~1 := 0; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {111462#true} #res := ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111462#true} {111462#true} #1239#return; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {111462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111462#true} is VALID [2022-02-20 19:57:51,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {111462#true} assume !(0 != ~tmp___0~1); {111462#true} is VALID [2022-02-20 19:57:51,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,359 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1245#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {111505#(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); {111462#true} is VALID [2022-02-20 19:57:51,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume !(1 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:51,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1247#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#true} havoc ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:51,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111462#true} is VALID [2022-02-20 19:57:51,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} #res := ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:51,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,365 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1249#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111462#true} is VALID [2022-02-20 19:57:51,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {111462#true} is VALID [2022-02-20 19:57:51,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111504#(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 19:57:51,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {111504#(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); {111462#true} is VALID [2022-02-20 19:57:51,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,368 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1241#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,369 INFO L272 TraceCheckUtils]: 12: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111505#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:51,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {111505#(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); {111462#true} is VALID [2022-02-20 19:57:51,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {111462#true} assume !(0 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:51,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,370 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1243#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,370 INFO L272 TraceCheckUtils]: 17: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111506#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:51,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {111506#(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; {111462#true} is VALID [2022-02-20 19:57:51,370 INFO L272 TraceCheckUtils]: 19: Hoare triple {111462#true} call #t~ret8 := is_do_write_p_triggered(); {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {111462#true} havoc ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {111462#true} assume !(1 == ~p_dw_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {111462#true} ~__retres1~0 := 0; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {111462#true} #res := ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111462#true} {111462#true} #1237#return; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {111462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {111462#true} assume !(0 != ~tmp~1); {111462#true} is VALID [2022-02-20 19:57:51,371 INFO L272 TraceCheckUtils]: 28: Hoare triple {111462#true} call #t~ret9 := is_do_read_c_triggered(); {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {111462#true} havoc ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {111462#true} assume !(1 == ~c_dr_pc~0); {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {111462#true} ~__retres1~1 := 0; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {111462#true} #res := ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111462#true} {111462#true} #1239#return; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {111462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {111462#true} assume !(0 != ~tmp___0~1); {111462#true} is VALID [2022-02-20 19:57:51,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,373 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1245#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,373 INFO L272 TraceCheckUtils]: 39: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111505#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:51,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {111505#(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); {111462#true} is VALID [2022-02-20 19:57:51,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {111462#true} assume !(1 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:51,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,374 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1247#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,375 INFO L272 TraceCheckUtils]: 47: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111462#true} is VALID [2022-02-20 19:57:51,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {111462#true} havoc ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:51,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {111462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111462#true} is VALID [2022-02-20 19:57:51,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {111462#true} #res := ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:51,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:51,376 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111462#true} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1249#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:51,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:51,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:51,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:51,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {111463#false} is VALID [2022-02-20 19:57:51,382 INFO L272 TraceCheckUtils]: 72: Hoare triple {111463#false} call error1(); {111463#false} is VALID [2022-02-20 19:57:51,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {111463#false} assume !false; {111463#false} is VALID [2022-02-20 19:57:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:51,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:51,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437601784] [2022-02-20 19:57:51,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437601784] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:51,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975787253] [2022-02-20 19:57:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:51,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:51,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:57:51,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:57:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:52,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111462#true} is VALID [2022-02-20 19:57:52,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {111462#true} is VALID [2022-02-20 19:57:52,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,096 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1241#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,098 INFO L272 TraceCheckUtils]: 12: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1243#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,100 INFO L272 TraceCheckUtils]: 17: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,103 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1237#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,104 INFO L272 TraceCheckUtils]: 28: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,106 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1239#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,108 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1245#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,108 INFO L272 TraceCheckUtils]: 39: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,110 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1247#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,111 INFO L272 TraceCheckUtils]: 47: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,113 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1249#return; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:52,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {111464#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {111502#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {111729#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {111729#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {111729#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:52,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {111729#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {111463#false} is VALID [2022-02-20 19:57:52,120 INFO L272 TraceCheckUtils]: 72: Hoare triple {111463#false} call error1(); {111463#false} is VALID [2022-02-20 19:57:52,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {111463#false} assume !false; {111463#false} is VALID [2022-02-20 19:57:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:52,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:52,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {111463#false} assume !false; {111463#false} is VALID [2022-02-20 19:57:52,454 INFO L272 TraceCheckUtils]: 72: Hoare triple {111463#false} call error1(); {111463#false} is VALID [2022-02-20 19:57:52,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {111463#false} is VALID [2022-02-20 19:57:52,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {111754#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:52,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,461 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111462#true} {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1249#return; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {111462#true} #res := ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:52,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {111462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111462#true} is VALID [2022-02-20 19:57:52,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {111462#true} havoc ~__retres1~2; {111462#true} is VALID [2022-02-20 19:57:52,462 INFO L272 TraceCheckUtils]: 47: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111462#true} is VALID [2022-02-20 19:57:52,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,463 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111462#true} {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1247#return; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {111462#true} assume !(1 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:52,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {111462#true} assume !(1 == ~q_read_ev~0); {111462#true} is VALID [2022-02-20 19:57:52,463 INFO L272 TraceCheckUtils]: 39: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {111462#true} is VALID [2022-02-20 19:57:52,463 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111462#true} {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1245#return; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {111462#true} assume !(0 != ~tmp___0~1); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {111462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111462#true} {111462#true} #1239#return; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {111462#true} #res := ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {111462#true} ~__retres1~1 := 0; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {111462#true} assume !(1 == ~c_dr_pc~0); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {111462#true} havoc ~__retres1~1; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L272 TraceCheckUtils]: 28: Hoare triple {111462#true} call #t~ret9 := is_do_read_c_triggered(); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {111462#true} assume !(0 != ~tmp~1); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {111462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111462#true} {111462#true} #1237#return; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {111462#true} #res := ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {111462#true} ~__retres1~0 := 0; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {111462#true} assume !(1 == ~p_dw_pc~0); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {111462#true} havoc ~__retres1~0; {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L272 TraceCheckUtils]: 19: Hoare triple {111462#true} call #t~ret8 := is_do_write_p_triggered(); {111462#true} is VALID [2022-02-20 19:57:52,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {111462#true} havoc ~tmp~1;havoc ~tmp___0~1; {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111462#true} {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1243#return; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {111462#true} assume !(0 == ~q_write_ev~0); {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {111462#true} assume !(0 == ~q_read_ev~0); {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {111462#true} is VALID [2022-02-20 19:57:52,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,467 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111462#true} {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1241#return; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {111462#true} assume true; {111462#true} is VALID [2022-02-20 19:57:52,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {111462#true} assume !(1 == ~q_req_up~0); {111462#true} is VALID [2022-02-20 19:57:52,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {111462#true} is VALID [2022-02-20 19:57:52,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {111462#true} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#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;~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; {111503#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:52,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {111462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {111462#true} is VALID [2022-02-20 19:57:52,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {111462#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111462#true} is VALID [2022-02-20 19:57:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:52,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975787253] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:52,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:52,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:52,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477490975] [2022-02-20 19:57:52,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:57:52,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:52,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:52,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:52,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:52,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:52,600 INFO L87 Difference]: Start difference. First operand 4354 states and 5485 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,928 INFO L93 Difference]: Finished difference Result 8895 states and 11093 transitions. [2022-02-20 19:58:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 19:58:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1106 transitions. [2022-02-20 19:58:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1106 transitions. [2022-02-20 19:58:01,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 1106 transitions. [2022-02-20 19:58:02,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1106 edges. 1106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.