./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.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.08.cil-2.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 dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:30,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:30,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:30,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:30,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:30,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:30,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:30,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:30,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:30,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:30,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:30,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:30,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:30,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:30,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:30,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:30,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:30,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:30,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:30,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:30,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:30,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:30,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:30,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:30,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:30,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:30,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:30,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:30,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:30,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:30,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:30,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:30,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:30,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:30,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:30,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:30,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:30,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:30,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:30,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:30,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:30,637 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:30,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:30,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:30,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:30,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:30,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:30,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:30,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:30,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:30,659 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:30,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:30,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:30,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:30,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:30,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:30,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:30,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:30,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:30,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:30,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:30,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:30,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:30,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:30,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:30,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:30,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:30,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:30,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:30,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:30,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:30,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:30,665 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:30,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:30,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:30,666 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 -> dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b [2022-02-20 19:57:30,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:30,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:30,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:30,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:30,915 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:30,916 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.08.cil-2.c [2022-02-20 19:57:30,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45d34483/27cb3b9775a44172957e5823864390f2/FLAGe97b6e7a9 [2022-02-20 19:57:31,443 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:31,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2022-02-20 19:57:31,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45d34483/27cb3b9775a44172957e5823864390f2/FLAGe97b6e7a9 [2022-02-20 19:57:31,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45d34483/27cb3b9775a44172957e5823864390f2 [2022-02-20 19:57:31,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:31,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:31,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:31,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:31,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:31,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:31" (1/1) ... [2022-02-20 19:57:31,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376359fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:31, skipping insertion in model container [2022-02-20 19:57:31,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:31" (1/1) ... [2022-02-20 19:57:31,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:31,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:31,698 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.08.cil-2.c[914,927] [2022-02-20 19:57:31,750 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.08.cil-2.c[7115,7128] [2022-02-20 19:57:31,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:31,858 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:31,867 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.08.cil-2.c[914,927] [2022-02-20 19:57:31,884 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.08.cil-2.c[7115,7128] [2022-02-20 19:57:31,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:31,978 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:31,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:31 WrapperNode [2022-02-20 19:57:31,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:31,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:31,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:31,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:31,986 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:31" (1/1) ... [2022-02-20 19:57:31,998 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:31" (1/1) ... [2022-02-20 19:57:32,061 INFO L137 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 813 [2022-02-20 19:57:32,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:32,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:32,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:32,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:32,070 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:31" (1/1) ... [2022-02-20 19:57:32,070 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:31" (1/1) ... [2022-02-20 19:57:32,083 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:31" (1/1) ... [2022-02-20 19:57:32,085 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:31" (1/1) ... [2022-02-20 19:57:32,098 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:31" (1/1) ... [2022-02-20 19:57:32,110 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:31" (1/1) ... [2022-02-20 19:57:32,113 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:31" (1/1) ... [2022-02-20 19:57:32,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:32,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:32,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:32,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:32,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:31" (1/1) ... [2022-02-20 19:57:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:32,164 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:32,189 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:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:32,224 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:32,225 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:32,228 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:32,228 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:32,228 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:32,230 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:32,393 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:32,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:33,201 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:33,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:33,223 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-02-20 19:57:33,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:33 BoogieIcfgContainer [2022-02-20 19:57:33,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:33,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:33,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:33,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:33,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:31" (1/3) ... [2022-02-20 19:57:33,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6045647d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:33, skipping insertion in model container [2022-02-20 19:57:33,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:31" (2/3) ... [2022-02-20 19:57:33,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6045647d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:33, skipping insertion in model container [2022-02-20 19:57:33,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:33" (3/3) ... [2022-02-20 19:57:33,237 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2022-02-20 19:57:33,241 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:33,242 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:33,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:33,304 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:33,305 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 335 states have (on average 1.626865671641791) internal successors, (545), 343 states have internal predecessors, (545), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-20 19:57:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:33,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:33,367 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:33,368 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2101552932, now seen corresponding path program 1 times [2022-02-20 19:57:33,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:33,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709378835] [2022-02-20 19:57:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#(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); {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {396#(= ~q_read_ev~0 2)} #1465#return; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#(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; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#(= |old(~q_read_ev~0)| 0)} assume true; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {437#(= |old(~q_read_ev~0)| 0)} {396#(= ~q_read_ev~0 2)} #1467#return; {395#false} is VALID [2022-02-20 19:57:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#true} havoc ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume 1 == ~p_dw_pc~0; {394#true} is VALID [2022-02-20 19:57:33,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {394#true} is VALID [2022-02-20 19:57:33,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#true} #res := ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,720 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {394#true} {394#true} #1461#return; {394#true} is VALID [2022-02-20 19:57:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#true} havoc ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume 1 == ~c_dr_pc~0; {394#true} is VALID [2022-02-20 19:57:33,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {394#true} is VALID [2022-02-20 19:57:33,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#true} #res := ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,727 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {394#true} {394#true} #1463#return; {394#true} is VALID [2022-02-20 19:57:33,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#(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; {394#true} is VALID [2022-02-20 19:57:33,728 INFO L272 TraceCheckUtils]: 1: Hoare triple {394#true} call #t~ret8 := is_do_write_p_triggered(); {394#true} is VALID [2022-02-20 19:57:33,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} havoc ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#true} assume 1 == ~p_dw_pc~0; {394#true} is VALID [2022-02-20 19:57:33,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {394#true} is VALID [2022-02-20 19:57:33,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} #res := ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,729 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {394#true} {394#true} #1461#return; {394#true} is VALID [2022-02-20 19:57:33,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {394#true} is VALID [2022-02-20 19:57:33,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {394#true} is VALID [2022-02-20 19:57:33,730 INFO L272 TraceCheckUtils]: 10: Hoare triple {394#true} call #t~ret9 := is_do_read_c_triggered(); {394#true} is VALID [2022-02-20 19:57:33,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#true} havoc ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#true} assume 1 == ~c_dr_pc~0; {394#true} is VALID [2022-02-20 19:57:33,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {394#true} is VALID [2022-02-20 19:57:33,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#true} #res := ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,732 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {394#true} {394#true} #1463#return; {394#true} is VALID [2022-02-20 19:57:33,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {394#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {394#true} is VALID [2022-02-20 19:57:33,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {394#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {394#true} is VALID [2022-02-20 19:57:33,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,733 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {394#true} {395#false} #1469#return; {395#false} is VALID [2022-02-20 19:57:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {394#true} is VALID [2022-02-20 19:57:33,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {394#true} is VALID [2022-02-20 19:57:33,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {395#false} #1471#return; {395#false} is VALID [2022-02-20 19:57:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#true} havoc ~__retres1~2; {394#true} is VALID [2022-02-20 19:57:33,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {394#true} is VALID [2022-02-20 19:57:33,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} #res := ~__retres1~2; {394#true} is VALID [2022-02-20 19:57:33,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,748 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {394#true} {395#false} #1473#return; {395#false} is VALID [2022-02-20 19:57:33,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {394#true} is VALID [2022-02-20 19:57:33,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {394#true} is VALID [2022-02-20 19:57:33,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {396#(= ~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; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {396#(= ~q_read_ev~0 2)} call update_channels1(); {434#(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:33,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#(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); {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,754 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {435#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {396#(= ~q_read_ev~0 2)} #1465#return; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {396#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {396#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {396#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,757 INFO L272 TraceCheckUtils]: 12: Hoare triple {396#(= ~q_read_ev~0 2)} call fire_delta_events1(); {436#(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:33,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(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; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {437#(= |old(~q_read_ev~0)| 0)} assume true; {437#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,759 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {437#(= |old(~q_read_ev~0)| 0)} {396#(= ~q_read_ev~0 2)} #1467#return; {395#false} is VALID [2022-02-20 19:57:33,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {395#false} call activate_threads1(); {438#(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:33,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {438#(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; {394#true} is VALID [2022-02-20 19:57:33,760 INFO L272 TraceCheckUtils]: 19: Hoare triple {394#true} call #t~ret8 := is_do_write_p_triggered(); {394#true} is VALID [2022-02-20 19:57:33,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {394#true} havoc ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {394#true} assume 1 == ~p_dw_pc~0; {394#true} is VALID [2022-02-20 19:57:33,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {394#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {394#true} is VALID [2022-02-20 19:57:33,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {394#true} #res := ~__retres1~0; {394#true} is VALID [2022-02-20 19:57:33,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,761 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {394#true} {394#true} #1461#return; {394#true} is VALID [2022-02-20 19:57:33,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {394#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {394#true} is VALID [2022-02-20 19:57:33,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {394#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {394#true} is VALID [2022-02-20 19:57:33,762 INFO L272 TraceCheckUtils]: 28: Hoare triple {394#true} call #t~ret9 := is_do_read_c_triggered(); {394#true} is VALID [2022-02-20 19:57:33,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {394#true} havoc ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {394#true} assume 1 == ~c_dr_pc~0; {394#true} is VALID [2022-02-20 19:57:33,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {394#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {394#true} is VALID [2022-02-20 19:57:33,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {394#true} #res := ~__retres1~1; {394#true} is VALID [2022-02-20 19:57:33,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,763 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {394#true} {394#true} #1463#return; {394#true} is VALID [2022-02-20 19:57:33,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {394#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {394#true} is VALID [2022-02-20 19:57:33,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {394#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {394#true} is VALID [2022-02-20 19:57:33,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,764 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {394#true} {395#false} #1469#return; {395#false} is VALID [2022-02-20 19:57:33,764 INFO L272 TraceCheckUtils]: 39: Hoare triple {395#false} call reset_delta_events1(); {436#(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:33,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {436#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {394#true} is VALID [2022-02-20 19:57:33,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {394#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {394#true} is VALID [2022-02-20 19:57:33,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,765 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {394#true} {395#false} #1471#return; {395#false} is VALID [2022-02-20 19:57:33,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 19:57:33,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {395#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; {395#false} is VALID [2022-02-20 19:57:33,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 19:57:33,766 INFO L272 TraceCheckUtils]: 47: Hoare triple {395#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {394#true} is VALID [2022-02-20 19:57:33,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {394#true} havoc ~__retres1~2; {394#true} is VALID [2022-02-20 19:57:33,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {394#true} is VALID [2022-02-20 19:57:33,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {394#true} #res := ~__retres1~2; {394#true} is VALID [2022-02-20 19:57:33,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 19:57:33,768 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {394#true} {395#false} #1473#return; {395#false} is VALID [2022-02-20 19:57:33,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {395#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; {395#false} is VALID [2022-02-20 19:57:33,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {395#false} assume 0 != eval1_~tmp___1~0#1; {395#false} is VALID [2022-02-20 19:57:33,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {395#false} assume !(0 == ~p_dw_st~0); {395#false} is VALID [2022-02-20 19:57:33,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {395#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; {395#false} is VALID [2022-02-20 19:57:33,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {395#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; {395#false} is VALID [2022-02-20 19:57:33,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {395#false} assume 0 == ~c_dr_pc~0; {395#false} is VALID [2022-02-20 19:57:33,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 19:57:33,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {395#false} assume !(1 == ~q_free~0); {395#false} is VALID [2022-02-20 19:57:33,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {395#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; {395#false} is VALID [2022-02-20 19:57:33,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {395#false} assume !(~p_last_write~0 == ~c_last_read~0); {395#false} is VALID [2022-02-20 19:57:33,770 INFO L272 TraceCheckUtils]: 63: Hoare triple {395#false} call error1(); {395#false} is VALID [2022-02-20 19:57:33,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 19:57:33,771 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:33,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:33,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709378835] [2022-02-20 19:57:33,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709378835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:33,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:33,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:33,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667965683] [2022-02-20 19:57:33,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:33,781 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:33,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:33,786 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:33,841 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:33,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:33,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:33,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:33,865 INFO L87 Difference]: Start difference. First operand has 391 states, 335 states have (on average 1.626865671641791) internal successors, (545), 343 states have internal predecessors, (545), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) 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:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:37,198 INFO L93 Difference]: Finished difference Result 892 states and 1408 transitions. [2022-02-20 19:57:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:37,198 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:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:37,200 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:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1408 transitions. [2022-02-20 19:57:37,250 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:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1408 transitions. [2022-02-20 19:57:37,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1408 transitions. [2022-02-20 19:57:38,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1408 edges. 1408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:38,399 INFO L225 Difference]: With dead ends: 892 [2022-02-20 19:57:38,400 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 19:57:38,405 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:38,408 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 1227 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:38,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 1694 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:57:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 19:57:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 476. [2022-02-20 19:57:38,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:38,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:57:38,478 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:57:38,480 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:57:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,509 INFO L93 Difference]: Finished difference Result 515 states and 761 transitions. [2022-02-20 19:57:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 761 transitions. [2022-02-20 19:57:38,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 515 states. [2022-02-20 19:57:38,518 INFO L87 Difference]: Start difference. First operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 515 states. [2022-02-20 19:57:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,543 INFO L93 Difference]: Finished difference Result 515 states and 761 transitions. [2022-02-20 19:57:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 761 transitions. [2022-02-20 19:57:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:38,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 403 states have (on average 1.5086848635235732) internal successors, (608), 410 states have internal predecessors, (608), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:57:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 707 transitions. [2022-02-20 19:57:38,574 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 707 transitions. Word has length 65 [2022-02-20 19:57:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:38,574 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 707 transitions. [2022-02-20 19:57:38,575 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:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 707 transitions. [2022-02-20 19:57:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:38,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:38,577 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:38,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:38,578 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1789628413, now seen corresponding path program 1 times [2022-02-20 19:57:38,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:38,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877677923] [2022-02-20 19:57:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {3364#(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); {3365#(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:38,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3365#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3365#(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:38,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3365#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3326#(= ~q_write_ev~0 ~q_read_ev~0)} #1465#return; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {3365#(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); {3366#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {3366#(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; {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3326#(= ~q_write_ev~0 ~q_read_ev~0)} #1467#return; {3325#false} is VALID [2022-02-20 19:57:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {3324#true} havoc ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume !(1 == ~p_dw_pc~0); {3324#true} is VALID [2022-02-20 19:57:38,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} ~__retres1~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {3324#true} #res := ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,695 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3324#true} {3324#true} #1461#return; {3324#true} is VALID [2022-02-20 19:57:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {3324#true} havoc ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume 1 == ~c_dr_pc~0; {3324#true} is VALID [2022-02-20 19:57:38,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3324#true} is VALID [2022-02-20 19:57:38,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {3324#true} #res := ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,702 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3324#true} {3324#true} #1463#return; {3324#true} is VALID [2022-02-20 19:57:38,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {3368#(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; {3324#true} is VALID [2022-02-20 19:57:38,702 INFO L272 TraceCheckUtils]: 1: Hoare triple {3324#true} call #t~ret8 := is_do_write_p_triggered(); {3324#true} is VALID [2022-02-20 19:57:38,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} havoc ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {3324#true} assume !(1 == ~p_dw_pc~0); {3324#true} is VALID [2022-02-20 19:57:38,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {3324#true} ~__retres1~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {3324#true} #res := ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,704 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3324#true} {3324#true} #1461#return; {3324#true} is VALID [2022-02-20 19:57:38,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {3324#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3324#true} is VALID [2022-02-20 19:57:38,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {3324#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {3324#true} call #t~ret9 := is_do_read_c_triggered(); {3324#true} is VALID [2022-02-20 19:57:38,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#true} havoc ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3324#true} assume 1 == ~c_dr_pc~0; {3324#true} is VALID [2022-02-20 19:57:38,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {3324#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3324#true} is VALID [2022-02-20 19:57:38,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {3324#true} #res := ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,705 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3324#true} {3324#true} #1463#return; {3324#true} is VALID [2022-02-20 19:57:38,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {3324#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3324#true} is VALID [2022-02-20 19:57:38,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {3324#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,706 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3324#true} {3325#false} #1469#return; {3325#false} is VALID [2022-02-20 19:57:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {3365#(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); {3324#true} is VALID [2022-02-20 19:57:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3324#true} is VALID [2022-02-20 19:57:38,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3324#true} {3325#false} #1471#return; {3325#false} is VALID [2022-02-20 19:57:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {3324#true} havoc ~__retres1~2; {3324#true} is VALID [2022-02-20 19:57:38,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3324#true} is VALID [2022-02-20 19:57:38,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} #res := ~__retres1~2; {3324#true} is VALID [2022-02-20 19:57:38,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,725 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3324#true} {3325#false} #1473#return; {3325#false} is VALID [2022-02-20 19:57:38,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {3324#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {3324#true} is VALID [2022-02-20 19:57:38,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {3326#(= ~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; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3364#(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:38,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {3364#(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); {3365#(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:38,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {3365#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3365#(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:38,728 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3365#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3326#(= ~q_write_ev~0 ~q_read_ev~0)} #1465#return; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3326#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,731 INFO L272 TraceCheckUtils]: 12: Hoare triple {3326#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3365#(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:38,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {3365#(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); {3366#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {3366#(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; {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:38,732 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3367#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3326#(= ~q_write_ev~0 ~q_read_ev~0)} #1467#return; {3325#false} is VALID [2022-02-20 19:57:38,733 INFO L272 TraceCheckUtils]: 17: Hoare triple {3325#false} call activate_threads1(); {3368#(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:38,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {3368#(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; {3324#true} is VALID [2022-02-20 19:57:38,733 INFO L272 TraceCheckUtils]: 19: Hoare triple {3324#true} call #t~ret8 := is_do_write_p_triggered(); {3324#true} is VALID [2022-02-20 19:57:38,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {3324#true} havoc ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {3324#true} assume !(1 == ~p_dw_pc~0); {3324#true} is VALID [2022-02-20 19:57:38,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {3324#true} ~__retres1~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#true} #res := ~__retres1~0; {3324#true} is VALID [2022-02-20 19:57:38,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,734 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3324#true} {3324#true} #1461#return; {3324#true} is VALID [2022-02-20 19:57:38,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {3324#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3324#true} is VALID [2022-02-20 19:57:38,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {3324#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,735 INFO L272 TraceCheckUtils]: 28: Hoare triple {3324#true} call #t~ret9 := is_do_read_c_triggered(); {3324#true} is VALID [2022-02-20 19:57:38,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {3324#true} havoc ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {3324#true} assume 1 == ~c_dr_pc~0; {3324#true} is VALID [2022-02-20 19:57:38,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {3324#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3324#true} is VALID [2022-02-20 19:57:38,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {3324#true} #res := ~__retres1~1; {3324#true} is VALID [2022-02-20 19:57:38,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,736 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3324#true} {3324#true} #1463#return; {3324#true} is VALID [2022-02-20 19:57:38,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {3324#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3324#true} is VALID [2022-02-20 19:57:38,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {3324#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3324#true} is VALID [2022-02-20 19:57:38,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,737 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3324#true} {3325#false} #1469#return; {3325#false} is VALID [2022-02-20 19:57:38,737 INFO L272 TraceCheckUtils]: 39: Hoare triple {3325#false} call reset_delta_events1(); {3365#(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:38,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {3365#(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); {3324#true} is VALID [2022-02-20 19:57:38,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {3324#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3324#true} is VALID [2022-02-20 19:57:38,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,738 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3324#true} {3325#false} #1471#return; {3325#false} is VALID [2022-02-20 19:57:38,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-02-20 19:57:38,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {3325#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; {3325#false} is VALID [2022-02-20 19:57:38,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-02-20 19:57:38,739 INFO L272 TraceCheckUtils]: 47: Hoare triple {3325#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3324#true} is VALID [2022-02-20 19:57:38,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {3324#true} havoc ~__retres1~2; {3324#true} is VALID [2022-02-20 19:57:38,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {3324#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3324#true} is VALID [2022-02-20 19:57:38,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {3324#true} #res := ~__retres1~2; {3324#true} is VALID [2022-02-20 19:57:38,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-02-20 19:57:38,740 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3324#true} {3325#false} #1473#return; {3325#false} is VALID [2022-02-20 19:57:38,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {3325#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; {3325#false} is VALID [2022-02-20 19:57:38,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {3325#false} assume 0 != eval1_~tmp___1~0#1; {3325#false} is VALID [2022-02-20 19:57:38,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {3325#false} assume !(0 == ~p_dw_st~0); {3325#false} is VALID [2022-02-20 19:57:38,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {3325#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; {3325#false} is VALID [2022-02-20 19:57:38,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {3325#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; {3325#false} is VALID [2022-02-20 19:57:38,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {3325#false} assume 0 == ~c_dr_pc~0; {3325#false} is VALID [2022-02-20 19:57:38,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-02-20 19:57:38,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {3325#false} assume !(1 == ~q_free~0); {3325#false} is VALID [2022-02-20 19:57:38,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {3325#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; {3325#false} is VALID [2022-02-20 19:57:38,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {3325#false} assume !(~p_last_write~0 == ~c_last_read~0); {3325#false} is VALID [2022-02-20 19:57:38,742 INFO L272 TraceCheckUtils]: 63: Hoare triple {3325#false} call error1(); {3325#false} is VALID [2022-02-20 19:57:38,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-02-20 19:57:38,743 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:38,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:38,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877677923] [2022-02-20 19:57:38,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877677923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:38,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:38,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:38,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196109206] [2022-02-20 19:57:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:38,746 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:38,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:38,747 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:38,801 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:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:38,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:38,802 INFO L87 Difference]: Start difference. First operand 476 states and 707 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:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,589 INFO L93 Difference]: Finished difference Result 823 states and 1184 transitions. [2022-02-20 19:57:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:42,590 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:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:42,590 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:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 913 transitions. [2022-02-20 19:57:42,603 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:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 913 transitions. [2022-02-20 19:57:42,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 913 transitions. [2022-02-20 19:57:43,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 913 edges. 913 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,429 INFO L225 Difference]: With dead ends: 823 [2022-02-20 19:57:43,429 INFO L226 Difference]: Without dead ends: 646 [2022-02-20 19:57:43,440 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:43,441 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 1161 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:43,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 2201 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 19:57:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-02-20 19:57:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 572. [2022-02-20 19:57:43,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:43,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:57:43,476 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:57:43,478 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:57:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,506 INFO L93 Difference]: Finished difference Result 646 states and 944 transitions. [2022-02-20 19:57:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 944 transitions. [2022-02-20 19:57:43,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) Second operand 646 states. [2022-02-20 19:57:43,512 INFO L87 Difference]: Start difference. First operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) Second operand 646 states. [2022-02-20 19:57:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,540 INFO L93 Difference]: Finished difference Result 646 states and 944 transitions. [2022-02-20 19:57:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 944 transitions. [2022-02-20 19:57:43,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:43,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 479 states have (on average 1.4864300626304803) internal successors, (712), 488 states have internal predecessors, (712), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:57:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 841 transitions. [2022-02-20 19:57:43,570 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 841 transitions. Word has length 65 [2022-02-20 19:57:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:43,571 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 841 transitions. [2022-02-20 19:57:43,571 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:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 841 transitions. [2022-02-20 19:57:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:43,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:43,573 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:43,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:43,574 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 476752773, now seen corresponding path program 1 times [2022-02-20 19:57:43,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:43,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596120606] [2022-02-20 19:57:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {6606#(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); {6567#true} is VALID [2022-02-20 19:57:43,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6567#true} {6567#true} #1465#return; {6567#true} is VALID [2022-02-20 19:57:43,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {6607#(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); {6567#true} is VALID [2022-02-20 19:57:43,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume !(0 == ~q_write_ev~0); {6567#true} is VALID [2022-02-20 19:57:43,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6567#true} {6567#true} #1467#return; {6567#true} is VALID [2022-02-20 19:57:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {6567#true} havoc ~__retres1~0; {6567#true} is VALID [2022-02-20 19:57:43,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume !(1 == ~p_dw_pc~0); {6567#true} is VALID [2022-02-20 19:57:43,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} ~__retres1~0 := 0; {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,728 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6567#true} #1461#return; {6615#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {6567#true} havoc ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume 1 == ~c_dr_pc~0; {6567#true} is VALID [2022-02-20 19:57:43,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6567#true} is VALID [2022-02-20 19:57:43,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {6567#true} #res := ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,744 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6567#true} {6568#false} #1463#return; {6568#false} is VALID [2022-02-20 19:57:43,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {6608#(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; {6567#true} is VALID [2022-02-20 19:57:43,745 INFO L272 TraceCheckUtils]: 1: Hoare triple {6567#true} call #t~ret8 := is_do_write_p_triggered(); {6567#true} is VALID [2022-02-20 19:57:43,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} havoc ~__retres1~0; {6567#true} is VALID [2022-02-20 19:57:43,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {6567#true} assume !(1 == ~p_dw_pc~0); {6567#true} is VALID [2022-02-20 19:57:43,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {6567#true} ~__retres1~0 := 0; {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,750 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6567#true} #1461#return; {6615#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6615#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6616#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:43,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6616#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6568#false} is VALID [2022-02-20 19:57:43,752 INFO L272 TraceCheckUtils]: 10: Hoare triple {6568#false} call #t~ret9 := is_do_read_c_triggered(); {6567#true} is VALID [2022-02-20 19:57:43,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {6567#true} havoc ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {6567#true} assume 1 == ~c_dr_pc~0; {6567#true} is VALID [2022-02-20 19:57:43,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {6567#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6567#true} is VALID [2022-02-20 19:57:43,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {6567#true} #res := ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6567#true} {6568#false} #1463#return; {6568#false} is VALID [2022-02-20 19:57:43,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {6568#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6568#false} is VALID [2022-02-20 19:57:43,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {6568#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6568#false} is VALID [2022-02-20 19:57:43,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {6568#false} assume true; {6568#false} is VALID [2022-02-20 19:57:43,757 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6568#false} {6567#true} #1469#return; {6568#false} is VALID [2022-02-20 19:57:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {6607#(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); {6567#true} is VALID [2022-02-20 19:57:43,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6567#true} is VALID [2022-02-20 19:57:43,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6567#true} {6568#false} #1471#return; {6568#false} is VALID [2022-02-20 19:57:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {6567#true} havoc ~__retres1~2; {6567#true} is VALID [2022-02-20 19:57:43,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6567#true} is VALID [2022-02-20 19:57:43,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} #res := ~__retres1~2; {6567#true} is VALID [2022-02-20 19:57:43,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,774 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6567#true} {6568#false} #1473#return; {6568#false} is VALID [2022-02-20 19:57:43,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {6567#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {6567#true} is VALID [2022-02-20 19:57:43,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {6567#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {6567#true} is VALID [2022-02-20 19:57:43,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {6567#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {6567#true} is VALID [2022-02-20 19:57:43,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {6567#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; {6567#true} is VALID [2022-02-20 19:57:43,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {6567#true} call update_channels1(); {6606#(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:43,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {6606#(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); {6567#true} is VALID [2022-02-20 19:57:43,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,776 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6567#true} {6567#true} #1465#return; {6567#true} is VALID [2022-02-20 19:57:43,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {6567#true} assume { :begin_inline_init_threads1 } true; {6567#true} is VALID [2022-02-20 19:57:43,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {6567#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6567#true} is VALID [2022-02-20 19:57:43,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {6567#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6567#true} is VALID [2022-02-20 19:57:43,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {6567#true} assume { :end_inline_init_threads1 } true; {6567#true} is VALID [2022-02-20 19:57:43,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {6567#true} call fire_delta_events1(); {6607#(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:43,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {6607#(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); {6567#true} is VALID [2022-02-20 19:57:43,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {6567#true} assume !(0 == ~q_write_ev~0); {6567#true} is VALID [2022-02-20 19:57:43,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,778 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6567#true} {6567#true} #1467#return; {6567#true} is VALID [2022-02-20 19:57:43,779 INFO L272 TraceCheckUtils]: 17: Hoare triple {6567#true} call activate_threads1(); {6608#(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:43,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {6608#(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; {6567#true} is VALID [2022-02-20 19:57:43,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {6567#true} call #t~ret8 := is_do_write_p_triggered(); {6567#true} is VALID [2022-02-20 19:57:43,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {6567#true} havoc ~__retres1~0; {6567#true} is VALID [2022-02-20 19:57:43,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {6567#true} assume !(1 == ~p_dw_pc~0); {6567#true} is VALID [2022-02-20 19:57:43,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {6567#true} ~__retres1~0 := 0; {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {6623#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,781 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6624#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6567#true} #1461#return; {6615#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {6615#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6616#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:43,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {6616#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6568#false} is VALID [2022-02-20 19:57:43,791 INFO L272 TraceCheckUtils]: 28: Hoare triple {6568#false} call #t~ret9 := is_do_read_c_triggered(); {6567#true} is VALID [2022-02-20 19:57:43,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {6567#true} havoc ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {6567#true} assume 1 == ~c_dr_pc~0; {6567#true} is VALID [2022-02-20 19:57:43,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {6567#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6567#true} is VALID [2022-02-20 19:57:43,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {6567#true} #res := ~__retres1~1; {6567#true} is VALID [2022-02-20 19:57:43,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,792 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6567#true} {6568#false} #1463#return; {6568#false} is VALID [2022-02-20 19:57:43,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {6568#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6568#false} is VALID [2022-02-20 19:57:43,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {6568#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6568#false} is VALID [2022-02-20 19:57:43,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {6568#false} assume true; {6568#false} is VALID [2022-02-20 19:57:43,793 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6568#false} {6567#true} #1469#return; {6568#false} is VALID [2022-02-20 19:57:43,793 INFO L272 TraceCheckUtils]: 39: Hoare triple {6568#false} call reset_delta_events1(); {6607#(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:43,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {6607#(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); {6567#true} is VALID [2022-02-20 19:57:43,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {6567#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6567#true} is VALID [2022-02-20 19:57:43,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,794 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6567#true} {6568#false} #1471#return; {6568#false} is VALID [2022-02-20 19:57:43,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {6568#false} assume !false; {6568#false} is VALID [2022-02-20 19:57:43,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {6568#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; {6568#false} is VALID [2022-02-20 19:57:43,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {6568#false} assume !false; {6568#false} is VALID [2022-02-20 19:57:43,796 INFO L272 TraceCheckUtils]: 47: Hoare triple {6568#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6567#true} is VALID [2022-02-20 19:57:43,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {6567#true} havoc ~__retres1~2; {6567#true} is VALID [2022-02-20 19:57:43,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {6567#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6567#true} is VALID [2022-02-20 19:57:43,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {6567#true} #res := ~__retres1~2; {6567#true} is VALID [2022-02-20 19:57:43,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {6567#true} assume true; {6567#true} is VALID [2022-02-20 19:57:43,797 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6567#true} {6568#false} #1473#return; {6568#false} is VALID [2022-02-20 19:57:43,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {6568#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; {6568#false} is VALID [2022-02-20 19:57:43,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {6568#false} assume 0 != eval1_~tmp___1~0#1; {6568#false} is VALID [2022-02-20 19:57:43,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {6568#false} assume !(0 == ~p_dw_st~0); {6568#false} is VALID [2022-02-20 19:57:43,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {6568#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; {6568#false} is VALID [2022-02-20 19:57:43,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {6568#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; {6568#false} is VALID [2022-02-20 19:57:43,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {6568#false} assume 0 == ~c_dr_pc~0; {6568#false} is VALID [2022-02-20 19:57:43,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {6568#false} assume !false; {6568#false} is VALID [2022-02-20 19:57:43,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {6568#false} assume !(1 == ~q_free~0); {6568#false} is VALID [2022-02-20 19:57:43,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {6568#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; {6568#false} is VALID [2022-02-20 19:57:43,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {6568#false} assume !(~p_last_write~0 == ~c_last_read~0); {6568#false} is VALID [2022-02-20 19:57:43,800 INFO L272 TraceCheckUtils]: 63: Hoare triple {6568#false} call error1(); {6568#false} is VALID [2022-02-20 19:57:43,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {6568#false} assume !false; {6568#false} is VALID [2022-02-20 19:57:43,801 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:43,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:43,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596120606] [2022-02-20 19:57:43,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596120606] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:43,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:43,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:43,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673108131] [2022-02-20 19:57:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:43,805 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:43,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:43,806 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:43,856 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:43,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:43,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:43,858 INFO L87 Difference]: Start difference. First operand 572 states and 841 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:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,256 INFO L93 Difference]: Finished difference Result 873 states and 1255 transitions. [2022-02-20 19:57:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:47,257 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:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:47,257 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:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 731 transitions. [2022-02-20 19:57:47,264 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:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 731 transitions. [2022-02-20 19:57:47,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 731 transitions. [2022-02-20 19:57:47,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:47,852 INFO L225 Difference]: With dead ends: 873 [2022-02-20 19:57:47,852 INFO L226 Difference]: Without dead ends: 606 [2022-02-20 19:57:47,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:47,854 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 492 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:47,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 2525 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:57:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-02-20 19:57:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 577. [2022-02-20 19:57:47,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:47,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:57:47,885 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:57:47,886 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:57:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,908 INFO L93 Difference]: Finished difference Result 606 states and 885 transitions. [2022-02-20 19:57:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 885 transitions. [2022-02-20 19:57:47,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:47,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:47,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) Second operand 606 states. [2022-02-20 19:57:47,913 INFO L87 Difference]: Start difference. First operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) Second operand 606 states. [2022-02-20 19:57:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,936 INFO L93 Difference]: Finished difference Result 606 states and 885 transitions. [2022-02-20 19:57:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 885 transitions. [2022-02-20 19:57:47,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:47,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:47,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:47,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 483 states have (on average 1.4782608695652173) internal successors, (714), 492 states have internal predecessors, (714), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:57:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 844 transitions. [2022-02-20 19:57:47,963 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 844 transitions. Word has length 65 [2022-02-20 19:57:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:47,964 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 844 transitions. [2022-02-20 19:57:47,964 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:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 844 transitions. [2022-02-20 19:57:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:47,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:47,966 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:47,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:47,966 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -552606525, now seen corresponding path program 1 times [2022-02-20 19:57:47,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:47,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092468542] [2022-02-20 19:57:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {9835#(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); {9795#true} is VALID [2022-02-20 19:57:48,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9795#true} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1465#return; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {9836#(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); {9795#true} is VALID [2022-02-20 19:57:48,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume !(0 == ~q_write_ev~0); {9795#true} is VALID [2022-02-20 19:57:48,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9795#true} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1467#return; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {9795#true} havoc ~__retres1~0; {9795#true} is VALID [2022-02-20 19:57:48,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume !(1 == ~p_dw_pc~0); {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,166 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9795#true} #1461#return; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {9795#true} havoc ~__retres1~1; {9795#true} is VALID [2022-02-20 19:57:48,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume 1 == ~c_dr_pc~0; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,199 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1463#return; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {9837#(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; {9795#true} is VALID [2022-02-20 19:57:48,200 INFO L272 TraceCheckUtils]: 1: Hoare triple {9795#true} call #t~ret8 := is_do_write_p_triggered(); {9795#true} is VALID [2022-02-20 19:57:48,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {9795#true} havoc ~__retres1~0; {9795#true} is VALID [2022-02-20 19:57:48,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {9795#true} assume !(1 == ~p_dw_pc~0); {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,203 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9795#true} #1461#return; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,207 INFO L272 TraceCheckUtils]: 10: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {9795#true} is VALID [2022-02-20 19:57:48,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {9795#true} havoc ~__retres1~1; {9795#true} is VALID [2022-02-20 19:57:48,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {9795#true} assume 1 == ~c_dr_pc~0; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,212 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1463#return; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,214 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1469#return; {9796#false} is VALID [2022-02-20 19:57:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {9836#(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); {9795#true} is VALID [2022-02-20 19:57:48,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9795#true} is VALID [2022-02-20 19:57:48,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9795#true} {9796#false} #1471#return; {9796#false} is VALID [2022-02-20 19:57:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {9795#true} havoc ~__retres1~2; {9795#true} is VALID [2022-02-20 19:57:48,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9795#true} is VALID [2022-02-20 19:57:48,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {9795#true} #res := ~__retres1~2; {9795#true} is VALID [2022-02-20 19:57:48,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,225 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9795#true} {9796#false} #1473#return; {9796#false} is VALID [2022-02-20 19:57:48,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {9795#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {9795#true} is VALID [2022-02-20 19:57:48,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {9795#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {9795#true} is VALID [2022-02-20 19:57:48,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {9795#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~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; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {9835#(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:48,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {9835#(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); {9795#true} is VALID [2022-02-20 19:57:48,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,228 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9795#true} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1465#return; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {9836#(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:48,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {9836#(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); {9795#true} is VALID [2022-02-20 19:57:48,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {9795#true} assume !(0 == ~q_write_ev~0); {9795#true} is VALID [2022-02-20 19:57:48,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9795#true} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1467#return; {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:48,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {9837#(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:48,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {9837#(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; {9795#true} is VALID [2022-02-20 19:57:48,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {9795#true} call #t~ret8 := is_do_write_p_triggered(); {9795#true} is VALID [2022-02-20 19:57:48,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#true} havoc ~__retres1~0; {9795#true} is VALID [2022-02-20 19:57:48,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#true} assume !(1 == ~p_dw_pc~0); {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,234 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9795#true} #1461#return; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:48,235 INFO L272 TraceCheckUtils]: 28: Hoare triple {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {9795#true} is VALID [2022-02-20 19:57:48,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {9795#true} havoc ~__retres1~1; {9795#true} is VALID [2022-02-20 19:57:48,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {9795#true} assume 1 == ~c_dr_pc~0; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:48,237 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9852#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9844#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1463#return; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:48,240 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9851#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {9797#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1469#return; {9796#false} is VALID [2022-02-20 19:57:48,240 INFO L272 TraceCheckUtils]: 39: Hoare triple {9796#false} call reset_delta_events1(); {9836#(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:48,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {9836#(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); {9795#true} is VALID [2022-02-20 19:57:48,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {9795#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9795#true} is VALID [2022-02-20 19:57:48,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,241 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9795#true} {9796#false} #1471#return; {9796#false} is VALID [2022-02-20 19:57:48,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {9796#false} assume !false; {9796#false} is VALID [2022-02-20 19:57:48,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {9796#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; {9796#false} is VALID [2022-02-20 19:57:48,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {9796#false} assume !false; {9796#false} is VALID [2022-02-20 19:57:48,241 INFO L272 TraceCheckUtils]: 47: Hoare triple {9796#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9795#true} is VALID [2022-02-20 19:57:48,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {9795#true} havoc ~__retres1~2; {9795#true} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {9795#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9795#true} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {9795#true} #res := ~__retres1~2; {9795#true} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {9795#true} assume true; {9795#true} is VALID [2022-02-20 19:57:48,242 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9795#true} {9796#false} #1473#return; {9796#false} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {9796#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; {9796#false} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {9796#false} assume 0 != eval1_~tmp___1~0#1; {9796#false} is VALID [2022-02-20 19:57:48,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {9796#false} assume !(0 == ~p_dw_st~0); {9796#false} is VALID [2022-02-20 19:57:48,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {9796#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; {9796#false} is VALID [2022-02-20 19:57:48,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {9796#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; {9796#false} is VALID [2022-02-20 19:57:48,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {9796#false} assume 0 == ~c_dr_pc~0; {9796#false} is VALID [2022-02-20 19:57:48,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {9796#false} assume !false; {9796#false} is VALID [2022-02-20 19:57:48,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {9796#false} assume !(1 == ~q_free~0); {9796#false} is VALID [2022-02-20 19:57:48,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {9796#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; {9796#false} is VALID [2022-02-20 19:57:48,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {9796#false} assume !(~p_last_write~0 == ~c_last_read~0); {9796#false} is VALID [2022-02-20 19:57:48,244 INFO L272 TraceCheckUtils]: 63: Hoare triple {9796#false} call error1(); {9796#false} is VALID [2022-02-20 19:57:48,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {9796#false} assume !false; {9796#false} is VALID [2022-02-20 19:57:48,245 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:48,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:48,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092468542] [2022-02-20 19:57:48,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092468542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:48,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:48,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:48,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651332319] [2022-02-20 19:57:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:48,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:48,249 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), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:48,291 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:48,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:48,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:48,293 INFO L87 Difference]: Start difference. First operand 577 states and 844 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,940 INFO L93 Difference]: Finished difference Result 2239 states and 3116 transitions. [2022-02-20 19:57:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1380 transitions. [2022-02-20 19:57:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1380 transitions. [2022-02-20 19:57:54,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1380 transitions. [2022-02-20 19:57:56,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1380 edges. 1380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:56,359 INFO L225 Difference]: With dead ends: 2239 [2022-02-20 19:57:56,359 INFO L226 Difference]: Without dead ends: 1967 [2022-02-20 19:57:56,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 19:57:56,362 INFO L933 BasicCegarLoop]: 788 mSDtfsCounter, 2176 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:56,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2194 Valid, 2477 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:57:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-02-20 19:57:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1717. [2022-02-20 19:57:57,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:57,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1967 states. Second operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:57:57,062 INFO L74 IsIncluded]: Start isIncluded. First operand 1967 states. Second operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:57:57,065 INFO L87 Difference]: Start difference. First operand 1967 states. Second operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:57:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,241 INFO L93 Difference]: Finished difference Result 1967 states and 2652 transitions. [2022-02-20 19:57:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2652 transitions. [2022-02-20 19:57:57,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) Second operand 1967 states. [2022-02-20 19:57:57,256 INFO L87 Difference]: Start difference. First operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) Second operand 1967 states. [2022-02-20 19:57:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,453 INFO L93 Difference]: Finished difference Result 1967 states and 2652 transitions. [2022-02-20 19:57:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2652 transitions. [2022-02-20 19:57:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:57,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1383 states have (on average 1.3702096890817064) internal successors, (1895), 1412 states have internal predecessors, (1895), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:57:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2328 transitions. [2022-02-20 19:57:57,659 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2328 transitions. Word has length 65 [2022-02-20 19:57:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:57,659 INFO L470 AbstractCegarLoop]: Abstraction has 1717 states and 2328 transitions. [2022-02-20 19:57:57,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2328 transitions. [2022-02-20 19:57:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:57,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:57,662 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:57,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:57,663 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 498842564, now seen corresponding path program 1 times [2022-02-20 19:57:57,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:57,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309054164] [2022-02-20 19:57:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {19169#(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); {19130#true} is VALID [2022-02-20 19:57:57,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19130#true} {19130#true} #1465#return; {19130#true} is VALID [2022-02-20 19:57:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {19170#(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); {19130#true} is VALID [2022-02-20 19:57:57,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume !(0 == ~q_write_ev~0); {19130#true} is VALID [2022-02-20 19:57:57,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19130#true} {19130#true} #1467#return; {19130#true} is VALID [2022-02-20 19:57:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {19130#true} havoc ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume !(1 == ~p_dw_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} ~__retres1~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {19130#true} #res := ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,780 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19130#true} {19130#true} #1461#return; {19130#true} is VALID [2022-02-20 19:57:57,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {19130#true} havoc ~__retres1~1; {19130#true} is VALID [2022-02-20 19:57:57,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume !(1 == ~c_dr_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} ~__retres1~1 := 0; {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,820 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19130#true} #1463#return; {19184#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {19171#(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; {19130#true} is VALID [2022-02-20 19:57:57,821 INFO L272 TraceCheckUtils]: 1: Hoare triple {19130#true} call #t~ret8 := is_do_write_p_triggered(); {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} havoc ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {19130#true} assume !(1 == ~p_dw_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {19130#true} ~__retres1~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {19130#true} #res := ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,822 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19130#true} {19130#true} #1461#return; {19130#true} is VALID [2022-02-20 19:57:57,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {19130#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19130#true} is VALID [2022-02-20 19:57:57,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {19130#true} assume !(0 != ~tmp~1); {19130#true} is VALID [2022-02-20 19:57:57,823 INFO L272 TraceCheckUtils]: 10: Hoare triple {19130#true} call #t~ret9 := is_do_read_c_triggered(); {19130#true} is VALID [2022-02-20 19:57:57,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {19130#true} havoc ~__retres1~1; {19130#true} is VALID [2022-02-20 19:57:57,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {19130#true} assume !(1 == ~c_dr_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {19130#true} ~__retres1~1 := 0; {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,825 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19130#true} #1463#return; {19184#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {19184#(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; {19185#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:57,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {19185#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19131#false} is VALID [2022-02-20 19:57:57,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {19131#false} assume true; {19131#false} is VALID [2022-02-20 19:57:57,827 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19131#false} {19130#true} #1469#return; {19131#false} is VALID [2022-02-20 19:57:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {19170#(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); {19130#true} is VALID [2022-02-20 19:57:57,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19130#true} is VALID [2022-02-20 19:57:57,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19130#true} {19131#false} #1471#return; {19131#false} is VALID [2022-02-20 19:57:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {19130#true} havoc ~__retres1~2; {19130#true} is VALID [2022-02-20 19:57:57,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19130#true} is VALID [2022-02-20 19:57:57,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} #res := ~__retres1~2; {19130#true} is VALID [2022-02-20 19:57:57,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,840 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19130#true} {19131#false} #1473#return; {19131#false} is VALID [2022-02-20 19:57:57,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {19130#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {19130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {19130#true} is VALID [2022-02-20 19:57:57,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {19130#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {19130#true} is VALID [2022-02-20 19:57:57,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {19130#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; {19130#true} is VALID [2022-02-20 19:57:57,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {19130#true} call update_channels1(); {19169#(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:57,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {19169#(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); {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19130#true} {19130#true} #1465#return; {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {19130#true} assume { :begin_inline_init_threads1 } true; {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {19130#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {19130#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {19130#true} assume { :end_inline_init_threads1 } true; {19130#true} is VALID [2022-02-20 19:57:57,843 INFO L272 TraceCheckUtils]: 12: Hoare triple {19130#true} call fire_delta_events1(); {19170#(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:57,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {19170#(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); {19130#true} is VALID [2022-02-20 19:57:57,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {19130#true} assume !(0 == ~q_write_ev~0); {19130#true} is VALID [2022-02-20 19:57:57,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19130#true} {19130#true} #1467#return; {19130#true} is VALID [2022-02-20 19:57:57,844 INFO L272 TraceCheckUtils]: 17: Hoare triple {19130#true} call activate_threads1(); {19171#(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:57,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {19171#(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; {19130#true} is VALID [2022-02-20 19:57:57,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {19130#true} call #t~ret8 := is_do_write_p_triggered(); {19130#true} is VALID [2022-02-20 19:57:57,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {19130#true} havoc ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {19130#true} assume !(1 == ~p_dw_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {19130#true} ~__retres1~0 := 0; {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {19130#true} #res := ~__retres1~0; {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19130#true} {19130#true} #1461#return; {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {19130#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {19130#true} assume !(0 != ~tmp~1); {19130#true} is VALID [2022-02-20 19:57:57,845 INFO L272 TraceCheckUtils]: 28: Hoare triple {19130#true} call #t~ret9 := is_do_read_c_triggered(); {19130#true} is VALID [2022-02-20 19:57:57,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {19130#true} havoc ~__retres1~1; {19130#true} is VALID [2022-02-20 19:57:57,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {19130#true} assume !(1 == ~c_dr_pc~0); {19130#true} is VALID [2022-02-20 19:57:57,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {19130#true} ~__retres1~1 := 0; {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {19186#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,848 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19187#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19130#true} #1463#return; {19184#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {19184#(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; {19185#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:57,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {19185#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19131#false} is VALID [2022-02-20 19:57:57,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {19131#false} assume true; {19131#false} is VALID [2022-02-20 19:57:57,849 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19131#false} {19130#true} #1469#return; {19131#false} is VALID [2022-02-20 19:57:57,849 INFO L272 TraceCheckUtils]: 39: Hoare triple {19131#false} call reset_delta_events1(); {19170#(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:57,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {19170#(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); {19130#true} is VALID [2022-02-20 19:57:57,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {19130#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19130#true} is VALID [2022-02-20 19:57:57,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,850 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19130#true} {19131#false} #1471#return; {19131#false} is VALID [2022-02-20 19:57:57,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {19131#false} assume !false; {19131#false} is VALID [2022-02-20 19:57:57,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {19131#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; {19131#false} is VALID [2022-02-20 19:57:57,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {19131#false} assume !false; {19131#false} is VALID [2022-02-20 19:57:57,850 INFO L272 TraceCheckUtils]: 47: Hoare triple {19131#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19130#true} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {19130#true} havoc ~__retres1~2; {19130#true} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {19130#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19130#true} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {19130#true} #res := ~__retres1~2; {19130#true} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {19130#true} assume true; {19130#true} is VALID [2022-02-20 19:57:57,851 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19130#true} {19131#false} #1473#return; {19131#false} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {19131#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; {19131#false} is VALID [2022-02-20 19:57:57,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {19131#false} assume 0 != eval1_~tmp___1~0#1; {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {19131#false} assume !(0 == ~p_dw_st~0); {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {19131#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; {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {19131#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; {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {19131#false} assume 0 == ~c_dr_pc~0; {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {19131#false} assume !false; {19131#false} is VALID [2022-02-20 19:57:57,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {19131#false} assume !(1 == ~q_free~0); {19131#false} is VALID [2022-02-20 19:57:57,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {19131#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; {19131#false} is VALID [2022-02-20 19:57:57,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {19131#false} assume !(~p_last_write~0 == ~c_last_read~0); {19131#false} is VALID [2022-02-20 19:57:57,853 INFO L272 TraceCheckUtils]: 63: Hoare triple {19131#false} call error1(); {19131#false} is VALID [2022-02-20 19:57:57,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {19131#false} assume !false; {19131#false} is VALID [2022-02-20 19:57:57,853 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:57,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:57,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309054164] [2022-02-20 19:57:57,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309054164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:57,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:57,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:57,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922980082] [2022-02-20 19:57:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:57,856 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:57,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:57,857 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:57,895 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:57,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:57,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:57,896 INFO L87 Difference]: Start difference. First operand 1717 states and 2328 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:58:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:02,124 INFO L93 Difference]: Finished difference Result 3318 states and 4452 transitions. [2022-02-20 19:58:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:02,124 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:58:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:02,125 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:58:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 733 transitions. [2022-02-20 19:58:02,131 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:58:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 733 transitions. [2022-02-20 19:58:02,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 733 transitions. [2022-02-20 19:58:02,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:02,882 INFO L225 Difference]: With dead ends: 3318 [2022-02-20 19:58:02,883 INFO L226 Difference]: Without dead ends: 1906 [2022-02-20 19:58:02,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:02,887 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 729 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:02,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 2264 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2022-02-20 19:58:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1762. [2022-02-20 19:58:03,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:03,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1906 states. Second operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:58:03,560 INFO L74 IsIncluded]: Start isIncluded. First operand 1906 states. Second operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:58:03,563 INFO L87 Difference]: Start difference. First operand 1906 states. Second operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:58:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,688 INFO L93 Difference]: Finished difference Result 1906 states and 2547 transitions. [2022-02-20 19:58:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2547 transitions. [2022-02-20 19:58:03,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) Second operand 1906 states. [2022-02-20 19:58:03,699 INFO L87 Difference]: Start difference. First operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) Second operand 1906 states. [2022-02-20 19:58:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,828 INFO L93 Difference]: Finished difference Result 1906 states and 2547 transitions. [2022-02-20 19:58:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2547 transitions. [2022-02-20 19:58:03,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:03,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1419 states have (on average 1.354474982381959) internal successors, (1922), 1448 states have internal predecessors, (1922), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:58:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2367 transitions. [2022-02-20 19:58:03,957 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2367 transitions. Word has length 65 [2022-02-20 19:58:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:03,958 INFO L470 AbstractCegarLoop]: Abstraction has 1762 states and 2367 transitions. [2022-02-20 19:58:03,958 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:58:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2367 transitions. [2022-02-20 19:58:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:03,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:03,960 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:58:03,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:03,960 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1885045958, now seen corresponding path program 1 times [2022-02-20 19:58:03,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:03,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876798464] [2022-02-20 19:58:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {29822#(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); {29823#(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:58:04,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29823#(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:58:04,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1465#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {29823#(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); {29823#(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:58:04,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {29823#(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); {29823#(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:58:04,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29823#(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:58:04,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1467#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {29782#true} havoc ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {29782#true} assume !(1 == ~p_dw_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {29782#true} ~__retres1~0 := 0; {29782#true} is VALID [2022-02-20 19:58:04,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {29782#true} #res := ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,040 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29782#true} {29782#true} #1461#return; {29782#true} is VALID [2022-02-20 19:58:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {29782#true} havoc ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {29782#true} assume !(1 == ~c_dr_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {29782#true} ~__retres1~1 := 0; {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {29782#true} #res := ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29782#true} {29782#true} #1463#return; {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {29824#(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; {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L272 TraceCheckUtils]: 1: Hoare triple {29782#true} call #t~ret8 := is_do_write_p_triggered(); {29782#true} is VALID [2022-02-20 19:58:04,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {29782#true} havoc ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {29782#true} assume !(1 == ~p_dw_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {29782#true} ~__retres1~0 := 0; {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {29782#true} #res := ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29782#true} {29782#true} #1461#return; {29782#true} is VALID [2022-02-20 19:58:04,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {29782#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {29782#true} assume !(0 != ~tmp~1); {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L272 TraceCheckUtils]: 10: Hoare triple {29782#true} call #t~ret9 := is_do_read_c_triggered(); {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {29782#true} havoc ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {29782#true} assume !(1 == ~c_dr_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {29782#true} ~__retres1~1 := 0; {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {29782#true} #res := ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29782#true} {29782#true} #1463#return; {29782#true} is VALID [2022-02-20 19:58:04,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {29782#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29782#true} is VALID [2022-02-20 19:58:04,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {29782#true} assume !(0 != ~tmp___0~1); {29782#true} is VALID [2022-02-20 19:58:04,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,048 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29782#true} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1469#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {29823#(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); {29837#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:04,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {29837#(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; {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1471#return; {29783#false} is VALID [2022-02-20 19:58:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {29782#true} havoc ~__retres1~2; {29782#true} is VALID [2022-02-20 19:58:04,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {29782#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29782#true} is VALID [2022-02-20 19:58:04,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {29782#true} #res := ~__retres1~2; {29782#true} is VALID [2022-02-20 19:58:04,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,088 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29782#true} {29783#false} #1473#return; {29783#false} is VALID [2022-02-20 19:58:04,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {29782#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {29782#true} is VALID [2022-02-20 19:58:04,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {29782#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {29782#true} is VALID [2022-02-20 19:58:04,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {29782#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {29784#(= ~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; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29822#(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:58:04,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {29822#(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); {29823#(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:58:04,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29823#(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:58:04,091 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1465#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,093 INFO L272 TraceCheckUtils]: 12: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29823#(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:58:04,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {29823#(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); {29823#(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:58:04,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {29823#(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); {29823#(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:58:04,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29823#(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:58:04,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29823#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1467#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,095 INFO L272 TraceCheckUtils]: 17: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29824#(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:58:04,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {29824#(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; {29782#true} is VALID [2022-02-20 19:58:04,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {29782#true} call #t~ret8 := is_do_write_p_triggered(); {29782#true} is VALID [2022-02-20 19:58:04,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {29782#true} havoc ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {29782#true} assume !(1 == ~p_dw_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {29782#true} ~__retres1~0 := 0; {29782#true} is VALID [2022-02-20 19:58:04,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {29782#true} #res := ~__retres1~0; {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29782#true} {29782#true} #1461#return; {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {29782#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {29782#true} assume !(0 != ~tmp~1); {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L272 TraceCheckUtils]: 28: Hoare triple {29782#true} call #t~ret9 := is_do_read_c_triggered(); {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {29782#true} havoc ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {29782#true} assume !(1 == ~c_dr_pc~0); {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {29782#true} ~__retres1~1 := 0; {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {29782#true} #res := ~__retres1~1; {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29782#true} {29782#true} #1463#return; {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {29782#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {29782#true} assume !(0 != ~tmp___0~1); {29782#true} is VALID [2022-02-20 19:58:04,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,099 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29782#true} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1469#return; {29784#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,100 INFO L272 TraceCheckUtils]: 39: Hoare triple {29784#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29823#(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:58:04,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {29823#(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); {29837#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:04,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {29837#(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; {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,101 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29838#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29784#(= ~q_write_ev~0 ~q_read_ev~0)} #1471#return; {29783#false} is VALID [2022-02-20 19:58:04,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {29783#false} assume !false; {29783#false} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {29783#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; {29783#false} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {29783#false} assume !false; {29783#false} is VALID [2022-02-20 19:58:04,102 INFO L272 TraceCheckUtils]: 47: Hoare triple {29783#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29782#true} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {29782#true} havoc ~__retres1~2; {29782#true} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {29782#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29782#true} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {29782#true} #res := ~__retres1~2; {29782#true} is VALID [2022-02-20 19:58:04,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {29782#true} assume true; {29782#true} is VALID [2022-02-20 19:58:04,103 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29782#true} {29783#false} #1473#return; {29783#false} is VALID [2022-02-20 19:58:04,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {29783#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; {29783#false} is VALID [2022-02-20 19:58:04,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {29783#false} assume 0 != eval1_~tmp___1~0#1; {29783#false} is VALID [2022-02-20 19:58:04,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {29783#false} assume !(0 == ~p_dw_st~0); {29783#false} is VALID [2022-02-20 19:58:04,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {29783#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; {29783#false} is VALID [2022-02-20 19:58:04,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {29783#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; {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {29783#false} assume 0 == ~c_dr_pc~0; {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {29783#false} assume !false; {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {29783#false} assume !(1 == ~q_free~0); {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {29783#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; {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {29783#false} assume !(~p_last_write~0 == ~c_last_read~0); {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L272 TraceCheckUtils]: 63: Hoare triple {29783#false} call error1(); {29783#false} is VALID [2022-02-20 19:58:04,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {29783#false} assume !false; {29783#false} is VALID [2022-02-20 19:58:04,105 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:58:04,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:04,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876798464] [2022-02-20 19:58:04,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876798464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:04,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:04,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:04,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996393835] [2022-02-20 19:58:04,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:04,106 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:58:04,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:04,107 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:58:04,146 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:58:04,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:04,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:04,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:04,148 INFO L87 Difference]: Start difference. First operand 1762 states and 2367 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:58:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:08,062 INFO L93 Difference]: Finished difference Result 3197 states and 4206 transitions. [2022-02-20 19:58:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:08,062 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:58:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:08,063 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:58:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 905 transitions. [2022-02-20 19:58:08,067 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:58:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 905 transitions. [2022-02-20 19:58:08,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 905 transitions. [2022-02-20 19:58:08,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 905 edges. 905 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:08,905 INFO L225 Difference]: With dead ends: 3197 [2022-02-20 19:58:08,905 INFO L226 Difference]: Without dead ends: 1960 [2022-02-20 19:58:08,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:08,908 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1131 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:08,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 1935 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2022-02-20 19:58:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1740. [2022-02-20 19:58:09,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:09,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1960 states. Second operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:58:09,638 INFO L74 IsIncluded]: Start isIncluded. First operand 1960 states. Second operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:58:09,640 INFO L87 Difference]: Start difference. First operand 1960 states. Second operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:58:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,804 INFO L93 Difference]: Finished difference Result 1960 states and 2594 transitions. [2022-02-20 19:58:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2594 transitions. [2022-02-20 19:58:09,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:09,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:09,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) Second operand 1960 states. [2022-02-20 19:58:09,818 INFO L87 Difference]: Start difference. First operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) Second operand 1960 states. [2022-02-20 19:58:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,944 INFO L93 Difference]: Finished difference Result 1960 states and 2594 transitions. [2022-02-20 19:58:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2594 transitions. [2022-02-20 19:58:09,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:09,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:09,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:09,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1405 states have (on average 1.3508896797153025) internal successors, (1898), 1428 states have internal predecessors, (1898), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:58:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2327 transitions. [2022-02-20 19:58:10,100 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2327 transitions. Word has length 65 [2022-02-20 19:58:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:10,101 INFO L470 AbstractCegarLoop]: Abstraction has 1740 states and 2327 transitions. [2022-02-20 19:58:10,101 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:58:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2327 transitions. [2022-02-20 19:58:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:10,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:10,102 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:58:10,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:10,103 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1751032452, now seen corresponding path program 1 times [2022-02-20 19:58:10,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:10,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898060917] [2022-02-20 19:58:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {40387#(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); {40347#true} is VALID [2022-02-20 19:58:10,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40347#true} {40347#true} #1465#return; {40347#true} is VALID [2022-02-20 19:58:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {40388#(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); {40347#true} is VALID [2022-02-20 19:58:10,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume !(0 == ~q_write_ev~0); {40347#true} is VALID [2022-02-20 19:58:10,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40347#true} {40352#(= ~p_dw_st~0 0)} #1467#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {40347#true} havoc ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume !(1 == ~p_dw_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} ~__retres1~0 := 0; {40347#true} is VALID [2022-02-20 19:58:10,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {40347#true} #res := ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,185 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1461#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {40347#true} havoc ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume !(1 == ~c_dr_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} ~__retres1~1 := 0; {40347#true} is VALID [2022-02-20 19:58:10,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {40347#true} #res := ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,191 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1463#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {40389#(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; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,192 INFO L272 TraceCheckUtils]: 1: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {40347#true} is VALID [2022-02-20 19:58:10,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} havoc ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {40347#true} assume !(1 == ~p_dw_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {40347#true} ~__retres1~0 := 0; {40347#true} is VALID [2022-02-20 19:58:10,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {40347#true} #res := ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,208 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1461#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,209 INFO L272 TraceCheckUtils]: 10: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {40347#true} is VALID [2022-02-20 19:58:10,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {40347#true} havoc ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {40347#true} assume !(1 == ~c_dr_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {40347#true} ~__retres1~1 := 0; {40347#true} is VALID [2022-02-20 19:58:10,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {40347#true} #res := ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,211 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1463#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,212 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {40352#(= ~p_dw_st~0 0)} #1469#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {40388#(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); {40347#true} is VALID [2022-02-20 19:58:10,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume !(1 == ~q_write_ev~0); {40347#true} is VALID [2022-02-20 19:58:10,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40347#true} {40352#(= ~p_dw_st~0 0)} #1471#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {40347#true} havoc ~__retres1~2; {40347#true} is VALID [2022-02-20 19:58:10,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {40352#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {40352#(= ~p_dw_st~0 0)} assume true; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,236 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40352#(= ~p_dw_st~0 0)} {40352#(= ~p_dw_st~0 0)} #1473#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {40347#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {40347#true} is VALID [2022-02-20 19:58:10,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {40347#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {40347#true} is VALID [2022-02-20 19:58:10,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {40347#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {40347#true} is VALID [2022-02-20 19:58:10,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {40347#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; {40347#true} is VALID [2022-02-20 19:58:10,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {40347#true} call update_channels1(); {40387#(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:58:10,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#(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); {40347#true} is VALID [2022-02-20 19:58:10,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,238 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40347#true} {40347#true} #1465#return; {40347#true} is VALID [2022-02-20 19:58:10,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {40347#true} assume { :begin_inline_init_threads1 } true; {40347#true} is VALID [2022-02-20 19:58:10,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {40347#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {40352#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {40352#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {40352#(= ~p_dw_st~0 0)} call fire_delta_events1(); {40388#(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:58:10,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {40388#(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); {40347#true} is VALID [2022-02-20 19:58:10,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {40347#true} assume !(0 == ~q_write_ev~0); {40347#true} is VALID [2022-02-20 19:58:10,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,241 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40347#true} {40352#(= ~p_dw_st~0 0)} #1467#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,241 INFO L272 TraceCheckUtils]: 17: Hoare triple {40352#(= ~p_dw_st~0 0)} call activate_threads1(); {40389#(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:58:10,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {40389#(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; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,242 INFO L272 TraceCheckUtils]: 19: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {40347#true} is VALID [2022-02-20 19:58:10,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {40347#true} havoc ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {40347#true} assume !(1 == ~p_dw_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {40347#true} ~__retres1~0 := 0; {40347#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {40347#true} #res := ~__retres1~0; {40347#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,243 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1461#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,245 INFO L272 TraceCheckUtils]: 28: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {40347#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {40347#true} havoc ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {40347#true} assume !(1 == ~c_dr_pc~0); {40347#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {40347#true} ~__retres1~1 := 0; {40347#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {40347#true} #res := ~__retres1~1; {40347#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,246 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {40347#true} {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1463#return; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,248 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40390#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {40352#(= ~p_dw_st~0 0)} #1469#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,248 INFO L272 TraceCheckUtils]: 39: Hoare triple {40352#(= ~p_dw_st~0 0)} call reset_delta_events1(); {40388#(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:58:10,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {40388#(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); {40347#true} is VALID [2022-02-20 19:58:10,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {40347#true} assume !(1 == ~q_write_ev~0); {40347#true} is VALID [2022-02-20 19:58:10,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {40347#true} assume true; {40347#true} is VALID [2022-02-20 19:58:10,249 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40347#true} {40352#(= ~p_dw_st~0 0)} #1471#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {40352#(= ~p_dw_st~0 0)} assume !false; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {40352#(= ~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; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {40352#(= ~p_dw_st~0 0)} assume !false; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,250 INFO L272 TraceCheckUtils]: 47: Hoare triple {40352#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40347#true} is VALID [2022-02-20 19:58:10,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {40347#true} havoc ~__retres1~2; {40347#true} is VALID [2022-02-20 19:58:10,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {40347#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {40352#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {40352#(= ~p_dw_st~0 0)} assume true; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,252 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40352#(= ~p_dw_st~0 0)} {40352#(= ~p_dw_st~0 0)} #1473#return; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {40352#(= ~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; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {40352#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {40352#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {40352#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {40348#false} is VALID [2022-02-20 19:58:10,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {40348#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; {40348#false} is VALID [2022-02-20 19:58:10,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {40348#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; {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {40348#false} assume 0 == ~c_dr_pc~0; {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {40348#false} assume !false; {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {40348#false} assume !(1 == ~q_free~0); {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {40348#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; {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {40348#false} assume !(~p_last_write~0 == ~c_last_read~0); {40348#false} is VALID [2022-02-20 19:58:10,254 INFO L272 TraceCheckUtils]: 63: Hoare triple {40348#false} call error1(); {40348#false} is VALID [2022-02-20 19:58:10,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {40348#false} assume !false; {40348#false} is VALID [2022-02-20 19:58:10,255 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:58:10,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898060917] [2022-02-20 19:58:10,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898060917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:10,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879883124] [2022-02-20 19:58:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,257 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:58:10,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,258 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:58:10,298 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:58:10,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:10,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:10,299 INFO L87 Difference]: Start difference. First operand 1740 states and 2327 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:58:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,955 INFO L93 Difference]: Finished difference Result 4815 states and 6306 transitions. [2022-02-20 19:58:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:13,956 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:58:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,956 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:58:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 854 transitions. [2022-02-20 19:58:13,960 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:58:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 854 transitions. [2022-02-20 19:58:13,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 854 transitions. [2022-02-20 19:58:14,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 854 edges. 854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,053 INFO L225 Difference]: With dead ends: 4815 [2022-02-20 19:58:15,054 INFO L226 Difference]: Without dead ends: 3383 [2022-02-20 19:58:15,056 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:58:15,057 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 1094 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:15,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 1635 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-02-20 19:58:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3111. [2022-02-20 19:58:16,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:16,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3383 states. Second operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) [2022-02-20 19:58:16,333 INFO L74 IsIncluded]: Start isIncluded. First operand 3383 states. Second operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) [2022-02-20 19:58:16,338 INFO L87 Difference]: Start difference. First operand 3383 states. Second operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) [2022-02-20 19:58:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:16,819 INFO L93 Difference]: Finished difference Result 3383 states and 4394 transitions. [2022-02-20 19:58:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 4394 transitions. [2022-02-20 19:58:16,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:16,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:16,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) Second operand 3383 states. [2022-02-20 19:58:16,835 INFO L87 Difference]: Start difference. First operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) Second operand 3383 states. [2022-02-20 19:58:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,341 INFO L93 Difference]: Finished difference Result 3383 states and 4394 transitions. [2022-02-20 19:58:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 4394 transitions. [2022-02-20 19:58:17,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:17,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:17,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:17,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2471 states have (on average 1.301092675030352) internal successors, (3215), 2515 states have internal predecessors, (3215), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) [2022-02-20 19:58:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4068 transitions. [2022-02-20 19:58:17,802 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4068 transitions. Word has length 65 [2022-02-20 19:58:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:17,802 INFO L470 AbstractCegarLoop]: Abstraction has 3111 states and 4068 transitions. [2022-02-20 19:58:17,802 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:58:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4068 transitions. [2022-02-20 19:58:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:17,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:17,804 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:58:17,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:17,804 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -869770994, now seen corresponding path program 1 times [2022-02-20 19:58:17,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:17,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695906906] [2022-02-20 19:58:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {57817#(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); {57777#true} is VALID [2022-02-20 19:58:17,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1465#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {57818#(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); {57777#true} is VALID [2022-02-20 19:58:17,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume !(0 == ~q_write_ev~0); {57777#true} is VALID [2022-02-20 19:58:17,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1467#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {57777#true} havoc ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume !(1 == ~p_dw_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} ~__retres1~0 := 0; {57777#true} is VALID [2022-02-20 19:58:17,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {57777#true} #res := ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,880 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57777#true} {57777#true} #1461#return; {57777#true} is VALID [2022-02-20 19:58:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {57777#true} havoc ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume !(1 == ~c_dr_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} ~__retres1~1 := 0; {57777#true} is VALID [2022-02-20 19:58:17,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {57777#true} #res := ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,884 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57777#true} {57777#true} #1463#return; {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {57819#(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; {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L272 TraceCheckUtils]: 1: Hoare triple {57777#true} call #t~ret8 := is_do_write_p_triggered(); {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} havoc ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {57777#true} assume !(1 == ~p_dw_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {57777#true} ~__retres1~0 := 0; {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {57777#true} #res := ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57777#true} {57777#true} #1461#return; {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {57777#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {57777#true} assume !(0 != ~tmp~1); {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L272 TraceCheckUtils]: 10: Hoare triple {57777#true} call #t~ret9 := is_do_read_c_triggered(); {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {57777#true} havoc ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {57777#true} assume !(1 == ~c_dr_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {57777#true} ~__retres1~1 := 0; {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {57777#true} #res := ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57777#true} {57777#true} #1463#return; {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {57777#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57777#true} is VALID [2022-02-20 19:58:17,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {57777#true} assume !(0 != ~tmp___0~1); {57777#true} is VALID [2022-02-20 19:58:17,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,888 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1469#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {57818#(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); {57777#true} is VALID [2022-02-20 19:58:17,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume !(1 == ~q_write_ev~0); {57777#true} is VALID [2022-02-20 19:58:17,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1471#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {57777#true} havoc ~__retres1~2; {57777#true} is VALID [2022-02-20 19:58:17,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57777#true} is VALID [2022-02-20 19:58:17,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} #res := ~__retres1~2; {57777#true} is VALID [2022-02-20 19:58:17,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,898 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1473#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {57777#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;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {57777#true} is VALID [2022-02-20 19:58:17,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {57777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {57777#true} is VALID [2022-02-20 19:58:17,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {57777#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {57779#(= ~q_free~0 1)} call update_channels1(); {57817#(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:58:17,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {57817#(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); {57777#true} is VALID [2022-02-20 19:58:17,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,901 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1465#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {57779#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {57779#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {57779#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {57779#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {57779#(= ~q_free~0 1)} call fire_delta_events1(); {57818#(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:58:17,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {57818#(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); {57777#true} is VALID [2022-02-20 19:58:17,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {57777#true} assume !(0 == ~q_write_ev~0); {57777#true} is VALID [2022-02-20 19:58:17,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,904 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1467#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,905 INFO L272 TraceCheckUtils]: 17: Hoare triple {57779#(= ~q_free~0 1)} call activate_threads1(); {57819#(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:58:17,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {57819#(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; {57777#true} is VALID [2022-02-20 19:58:17,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {57777#true} call #t~ret8 := is_do_write_p_triggered(); {57777#true} is VALID [2022-02-20 19:58:17,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {57777#true} havoc ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {57777#true} assume !(1 == ~p_dw_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {57777#true} ~__retres1~0 := 0; {57777#true} is VALID [2022-02-20 19:58:17,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {57777#true} #res := ~__retres1~0; {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {57777#true} {57777#true} #1461#return; {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {57777#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {57777#true} assume !(0 != ~tmp~1); {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L272 TraceCheckUtils]: 28: Hoare triple {57777#true} call #t~ret9 := is_do_read_c_triggered(); {57777#true} is VALID [2022-02-20 19:58:17,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {57777#true} havoc ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {57777#true} assume !(1 == ~c_dr_pc~0); {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {57777#true} ~__retres1~1 := 0; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {57777#true} #res := ~__retres1~1; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {57777#true} {57777#true} #1463#return; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {57777#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57777#true} is VALID [2022-02-20 19:58:17,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {57777#true} assume !(0 != ~tmp___0~1); {57777#true} is VALID [2022-02-20 19:58:17,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,908 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1469#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,909 INFO L272 TraceCheckUtils]: 39: Hoare triple {57779#(= ~q_free~0 1)} call reset_delta_events1(); {57818#(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:58:17,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {57818#(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); {57777#true} is VALID [2022-02-20 19:58:17,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {57777#true} assume !(1 == ~q_write_ev~0); {57777#true} is VALID [2022-02-20 19:58:17,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,909 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1471#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {57779#(= ~q_free~0 1)} assume !false; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {57779#(= ~q_free~0 1)} assume !false; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,911 INFO L272 TraceCheckUtils]: 47: Hoare triple {57779#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57777#true} is VALID [2022-02-20 19:58:17,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {57777#true} havoc ~__retres1~2; {57777#true} is VALID [2022-02-20 19:58:17,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {57777#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57777#true} is VALID [2022-02-20 19:58:17,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {57777#true} #res := ~__retres1~2; {57777#true} is VALID [2022-02-20 19:58:17,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {57777#true} assume true; {57777#true} is VALID [2022-02-20 19:58:17,912 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {57777#true} {57779#(= ~q_free~0 1)} #1473#return; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {57779#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {57779#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {57779#(= ~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; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {57779#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {57779#(= ~q_free~0 1)} assume !false; {57779#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:17,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {57779#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {57778#false} is VALID [2022-02-20 19:58:17,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {57778#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; {57778#false} is VALID [2022-02-20 19:58:17,915 INFO L290 TraceCheckUtils]: 63: Hoare triple {57778#false} assume !(~p_last_write~0 == ~c_last_read~0); {57778#false} is VALID [2022-02-20 19:58:17,916 INFO L272 TraceCheckUtils]: 64: Hoare triple {57778#false} call error1(); {57778#false} is VALID [2022-02-20 19:58:17,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {57778#false} assume !false; {57778#false} is VALID [2022-02-20 19:58:17,916 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:58:17,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:17,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695906906] [2022-02-20 19:58:17,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695906906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:17,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:17,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:17,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196215324] [2022-02-20 19:58:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:17,918 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:58:17,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:17,918 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:58:17,960 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:58:17,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:17,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:17,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:17,962 INFO L87 Difference]: Start difference. First operand 3111 states and 4068 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:58:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:23,832 INFO L93 Difference]: Finished difference Result 8129 states and 10582 transitions. [2022-02-20 19:58:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:23,832 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:58:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:23,833 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:58:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 854 transitions. [2022-02-20 19:58:23,838 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:58:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 854 transitions. [2022-02-20 19:58:23,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 854 transitions. [2022-02-20 19:58:24,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 854 edges. 854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:25,524 INFO L225 Difference]: With dead ends: 8129 [2022-02-20 19:58:25,524 INFO L226 Difference]: Without dead ends: 5305 [2022-02-20 19:58:25,530 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:58:25,531 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 661 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:25,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 1643 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states.