./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/qrcu-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/qrcu-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1980d3c26a5811df2d100379a9d31e1e9ec963bc59bfe660be33ada51bfb014 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:39:35,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:39:35,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:39:35,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:39:35,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:39:35,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:39:35,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:39:35,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:39:35,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:39:35,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:39:35,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:39:35,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:39:35,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:39:35,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:39:35,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:39:35,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:39:35,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:39:35,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:39:35,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:39:35,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:39:35,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:39:35,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:39:35,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:39:35,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:39:35,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:39:35,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:39:35,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:39:35,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:39:35,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:39:35,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:39:35,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:39:35,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:39:35,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:39:35,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:39:35,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:39:35,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:39:35,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:39:35,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:39:35,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:39:35,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:39:35,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:39:35,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:39:35,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:39:35,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:39:35,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:39:35,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:39:35,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:39:35,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:39:35,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:39:35,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:39:35,564 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:39:35,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:39:35,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:39:35,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:39:35,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:39:35,566 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:39:35,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:39:35,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:39:35,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:39:35,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:39:35,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:39:35,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:39:35,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:39:35,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:39:35,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:39:35,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:39:35,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:39:35,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:39:35,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:39:35,568 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:39:35,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:39:35,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:39:35,569 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc 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 ! data-race) ) 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 -> d1980d3c26a5811df2d100379a9d31e1e9ec963bc59bfe660be33ada51bfb014 [2022-11-02 20:39:35,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:39:36,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:39:36,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:39:36,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:39:36,010 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:39:36,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/qrcu-2.i [2022-11-02 20:39:36,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/data/6ada6a243/cdd1dc46eba242a5bebdf09c6d1253f8/FLAG3aaf2128b [2022-11-02 20:39:36,798 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:39:36,800 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/sv-benchmarks/c/pthread-atomic/qrcu-2.i [2022-11-02 20:39:36,824 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/data/6ada6a243/cdd1dc46eba242a5bebdf09c6d1253f8/FLAG3aaf2128b [2022-11-02 20:39:37,024 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/data/6ada6a243/cdd1dc46eba242a5bebdf09c6d1253f8 [2022-11-02 20:39:37,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:39:37,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:39:37,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:39:37,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:39:37,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:39:37,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:37,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9418790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37, skipping insertion in model container [2022-11-02 20:39:37,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:37,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:39:37,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:39:37,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30690,30703] [2022-11-02 20:39:37,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30912,30925] [2022-11-02 20:39:37,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:39:37,773 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:39:37,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30690,30703] [2022-11-02 20:39:37,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30912,30925] [2022-11-02 20:39:37,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:39:37,955 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:39:37,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37 WrapperNode [2022-11-02 20:39:37,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:39:37,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:39:37,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:39:37,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:39:37,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,082 INFO L138 Inliner]: procedures = 177, calls = 44, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 441 [2022-11-02 20:39:38,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:39:38,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:39:38,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:39:38,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:39:38,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:39:38,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:39:38,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:39:38,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:39:38,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (1/1) ... [2022-11-02 20:39:38,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:39:38,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:39:38,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:39:38,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:39:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-11-02 20:39:38,270 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-11-02 20:39:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-11-02 20:39:38,271 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-11-02 20:39:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:39:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:39:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-11-02 20:39:38,272 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-11-02 20:39:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:39:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:39:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:39:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:39:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:39:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:39:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:39:38,277 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:39:38,531 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:39:38,533 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:39:39,525 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:39:40,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:39:40,049 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:39:40,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:39:40 BoogieIcfgContainer [2022-11-02 20:39:40,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:39:40,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:39:40,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:39:40,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:39:40,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:39:37" (1/3) ... [2022-11-02 20:39:40,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1310630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:39:40, skipping insertion in model container [2022-11-02 20:39:40,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:37" (2/3) ... [2022-11-02 20:39:40,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1310630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:39:40, skipping insertion in model container [2022-11-02 20:39:40,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:39:40" (3/3) ... [2022-11-02 20:39:40,108 INFO L112 eAbstractionObserver]: Analyzing ICFG qrcu-2.i [2022-11-02 20:39:40,119 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:39:40,162 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:39:40,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-11-02 20:39:40,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:39:40,429 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:39:40,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 323 transitions, 670 flow [2022-11-02 20:39:40,705 INFO L130 PetriNetUnfolder]: 18/320 cut-off events. [2022-11-02 20:39:40,705 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:39:40,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 320 events. 18/320 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 912 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 266. Up to 4 conditions per place. [2022-11-02 20:39:40,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 323 transitions, 670 flow [2022-11-02 20:39:40,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 308 transitions, 631 flow [2022-11-02 20:39:40,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:39:40,803 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@215f5dca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:39:40,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 110 error locations. [2022-11-02 20:39:40,821 INFO L130 PetriNetUnfolder]: 1/44 cut-off events. [2022-11-02 20:39:40,821 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:39:40,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:40,822 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:40,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 793044900, now seen corresponding path program 1 times [2022-11-02 20:39:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:40,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674972527] [2022-11-02 20:39:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:41,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674972527] [2022-11-02 20:39:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674972527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:41,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:41,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:39:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240906200] [2022-11-02 20:39:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:41,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:39:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:39:41,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:39:41,340 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-11-02 20:39:41,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 308 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:41,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:41,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-11-02 20:39:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:39:43,743 INFO L130 PetriNetUnfolder]: 1878/7749 cut-off events. [2022-11-02 20:39:43,743 INFO L131 PetriNetUnfolder]: For 439/439 co-relation queries the response was YES. [2022-11-02 20:39:43,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10478 conditions, 7749 events. 1878/7749 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 78157 event pairs, 529 based on Foata normal form. 556/6915 useless extension candidates. Maximal degree in co-relation 8605. Up to 1932 conditions per place. [2022-11-02 20:39:43,939 INFO L137 encePairwiseOnDemand]: 281/323 looper letters, 45 selfloop transitions, 8 changer transitions 0/299 dead transitions. [2022-11-02 20:39:43,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 299 transitions, 731 flow [2022-11-02 20:39:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:39:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:39:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2022-11-02 20:39:43,961 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9236326109391125 [2022-11-02 20:39:43,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2022-11-02 20:39:43,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2022-11-02 20:39:43,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:39:43,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2022-11-02 20:39:43,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:43,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:43,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:43,997 INFO L175 Difference]: Start difference. First operand has 300 places, 308 transitions, 631 flow. Second operand 3 states and 895 transitions. [2022-11-02 20:39:43,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 299 transitions, 731 flow [2022-11-02 20:39:44,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 299 transitions, 715 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:39:44,017 INFO L231 Difference]: Finished difference. Result has 273 places, 282 transitions, 618 flow [2022-11-02 20:39:44,020 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=273, PETRI_TRANSITIONS=282} [2022-11-02 20:39:44,025 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -27 predicate places. [2022-11-02 20:39:44,025 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 618 flow [2022-11-02 20:39:44,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:44,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:44,027 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:44,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:39:44,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1529989037, now seen corresponding path program 1 times [2022-11-02 20:39:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:44,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853762362] [2022-11-02 20:39:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853762362] [2022-11-02 20:39:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853762362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:44,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:39:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310852538] [2022-11-02 20:39:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:44,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:39:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:39:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:39:44,182 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-02 20:39:44,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 282 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:44,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:44,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-02 20:39:44,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:39:45,672 INFO L130 PetriNetUnfolder]: 1129/5556 cut-off events. [2022-11-02 20:39:45,672 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-11-02 20:39:45,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 5556 events. 1129/5556 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 55797 event pairs, 445 based on Foata normal form. 0/4480 useless extension candidates. Maximal degree in co-relation 3841. Up to 1108 conditions per place. [2022-11-02 20:39:45,783 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 28 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-11-02 20:39:45,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 292 transitions, 705 flow [2022-11-02 20:39:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:39:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:39:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-02 20:39:45,787 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-02 20:39:45,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-02 20:39:45,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-02 20:39:45,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:39:45,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-02 20:39:45,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:45,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:45,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:45,796 INFO L175 Difference]: Start difference. First operand has 273 places, 282 transitions, 618 flow. Second operand 3 states and 843 transitions. [2022-11-02 20:39:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 292 transitions, 705 flow [2022-11-02 20:39:45,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 292 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:39:45,821 INFO L231 Difference]: Finished difference. Result has 275 places, 285 transitions, 632 flow [2022-11-02 20:39:45,822 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=275, PETRI_TRANSITIONS=285} [2022-11-02 20:39:45,824 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -25 predicate places. [2022-11-02 20:39:45,824 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 632 flow [2022-11-02 20:39:45,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:45,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:45,827 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:39:45,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 66168034, now seen corresponding path program 1 times [2022-11-02 20:39:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:45,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569290770] [2022-11-02 20:39:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:45,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:45,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569290770] [2022-11-02 20:39:45,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569290770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:45,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:45,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:39:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074080125] [2022-11-02 20:39:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:45,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:39:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:39:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:39:45,947 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-02 20:39:45,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:45,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:45,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-02 20:39:45,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:39:47,816 INFO L130 PetriNetUnfolder]: 1240/6639 cut-off events. [2022-11-02 20:39:47,816 INFO L131 PetriNetUnfolder]: For 293/345 co-relation queries the response was YES. [2022-11-02 20:39:47,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 6639 events. 1240/6639 cut-off events. For 293/345 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 70236 event pairs, 442 based on Foata normal form. 4/5375 useless extension candidates. Maximal degree in co-relation 3116. Up to 1178 conditions per place. [2022-11-02 20:39:47,935 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-02 20:39:47,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 295 transitions, 725 flow [2022-11-02 20:39:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:39:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:39:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-02 20:39:47,947 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-02 20:39:47,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-02 20:39:47,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-02 20:39:47,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:39:47,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-02 20:39:47,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:47,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:47,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:47,957 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 632 flow. Second operand 3 states and 843 transitions. [2022-11-02 20:39:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 295 transitions, 725 flow [2022-11-02 20:39:47,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 295 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:39:47,966 INFO L231 Difference]: Finished difference. Result has 277 places, 288 transitions, 656 flow [2022-11-02 20:39:47,967 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=277, PETRI_TRANSITIONS=288} [2022-11-02 20:39:47,970 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -23 predicate places. [2022-11-02 20:39:47,971 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 288 transitions, 656 flow [2022-11-02 20:39:47,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:47,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:47,972 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:47,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:39:47,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1919312747, now seen corresponding path program 1 times [2022-11-02 20:39:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56014770] [2022-11-02 20:39:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:48,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56014770] [2022-11-02 20:39:48,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56014770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:48,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:48,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:39:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360873341] [2022-11-02 20:39:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:48,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:39:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:39:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:39:48,123 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-02 20:39:48,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 288 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:48,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:48,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-02 20:39:48,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:39:50,332 INFO L130 PetriNetUnfolder]: 1724/10617 cut-off events. [2022-11-02 20:39:50,333 INFO L131 PetriNetUnfolder]: For 569/602 co-relation queries the response was YES. [2022-11-02 20:39:50,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13925 conditions, 10617 events. 1724/10617 cut-off events. For 569/602 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 126401 event pairs, 668 based on Foata normal form. 0/8584 useless extension candidates. Maximal degree in co-relation 8405. Up to 1757 conditions per place. [2022-11-02 20:39:50,528 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 6 changer transitions 0/300 dead transitions. [2022-11-02 20:39:50,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 300 transitions, 767 flow [2022-11-02 20:39:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:39:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:39:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-02 20:39:50,535 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-02 20:39:50,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-02 20:39:50,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-02 20:39:50,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:39:50,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-02 20:39:50,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:50,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:50,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:50,550 INFO L175 Difference]: Start difference. First operand has 277 places, 288 transitions, 656 flow. Second operand 3 states and 843 transitions. [2022-11-02 20:39:50,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 300 transitions, 767 flow [2022-11-02 20:39:50,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 300 transitions, 753 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:39:50,568 INFO L231 Difference]: Finished difference. Result has 279 places, 293 transitions, 700 flow [2022-11-02 20:39:50,568 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=279, PETRI_TRANSITIONS=293} [2022-11-02 20:39:50,569 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -21 predicate places. [2022-11-02 20:39:50,570 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 293 transitions, 700 flow [2022-11-02 20:39:50,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:50,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:50,571 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:50,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:39:50,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1696456880, now seen corresponding path program 1 times [2022-11-02 20:39:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:50,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12976975] [2022-11-02 20:39:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12976975] [2022-11-02 20:39:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12976975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:39:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008636392] [2022-11-02 20:39:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:39:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:39:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:39:51,333 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 323 [2022-11-02 20:39:51,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 293 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:51,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:51,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 323 [2022-11-02 20:39:51,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:39:58,526 INFO L130 PetriNetUnfolder]: 7975/43722 cut-off events. [2022-11-02 20:39:58,527 INFO L131 PetriNetUnfolder]: For 3125/3160 co-relation queries the response was YES. [2022-11-02 20:39:58,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56580 conditions, 43722 events. 7975/43722 cut-off events. For 3125/3160 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 668689 event pairs, 1160 based on Foata normal form. 0/34690 useless extension candidates. Maximal degree in co-relation 28893. Up to 2836 conditions per place. [2022-11-02 20:39:59,056 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 92 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2022-11-02 20:39:59,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 348 transitions, 1138 flow [2022-11-02 20:39:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:39:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:39:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2022-11-02 20:39:59,062 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-11-02 20:39:59,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2022-11-02 20:39:59,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2022-11-02 20:39:59,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:39:59,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2022-11-02 20:39:59,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:59,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:59,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:59,076 INFO L175 Difference]: Start difference. First operand has 279 places, 293 transitions, 700 flow. Second operand 6 states and 1596 transitions. [2022-11-02 20:39:59,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 348 transitions, 1138 flow [2022-11-02 20:39:59,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 348 transitions, 1102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:39:59,094 INFO L231 Difference]: Finished difference. Result has 281 places, 292 transitions, 694 flow [2022-11-02 20:39:59,094 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=281, PETRI_TRANSITIONS=292} [2022-11-02 20:39:59,098 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-11-02 20:39:59,099 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 292 transitions, 694 flow [2022-11-02 20:39:59,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:59,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:39:59,101 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:39:59,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:39:59,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:39:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1949272664, now seen corresponding path program 1 times [2022-11-02 20:39:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878493286] [2022-11-02 20:39:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:39:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878493286] [2022-11-02 20:39:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878493286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:39:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741736465] [2022-11-02 20:39:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:59,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:39:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:39:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:39:59,201 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-02 20:39:59,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 292 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:39:59,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:39:59,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-02 20:39:59,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:01,592 INFO L130 PetriNetUnfolder]: 1966/13267 cut-off events. [2022-11-02 20:40:01,592 INFO L131 PetriNetUnfolder]: For 1045/1205 co-relation queries the response was YES. [2022-11-02 20:40:01,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17204 conditions, 13267 events. 1966/13267 cut-off events. For 1045/1205 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 167172 event pairs, 659 based on Foata normal form. 7/10717 useless extension candidates. Maximal degree in co-relation 15448. Up to 1805 conditions per place. [2022-11-02 20:40:01,760 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 34 selfloop transitions, 6 changer transitions 0/304 dead transitions. [2022-11-02 20:40:01,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 304 transitions, 815 flow [2022-11-02 20:40:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-02 20:40:01,765 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-02 20:40:01,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-02 20:40:01,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-02 20:40:01,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:01,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-02 20:40:01,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:01,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:01,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:01,774 INFO L175 Difference]: Start difference. First operand has 281 places, 292 transitions, 694 flow. Second operand 3 states and 843 transitions. [2022-11-02 20:40:01,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 304 transitions, 815 flow [2022-11-02 20:40:01,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 304 transitions, 808 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:40:01,785 INFO L231 Difference]: Finished difference. Result has 281 places, 297 transitions, 747 flow [2022-11-02 20:40:01,785 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=281, PETRI_TRANSITIONS=297} [2022-11-02 20:40:01,786 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-11-02 20:40:01,787 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 297 transitions, 747 flow [2022-11-02 20:40:01,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:01,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:01,788 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:40:01,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:40:01,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:40:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1269489537, now seen corresponding path program 1 times [2022-11-02 20:40:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:01,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493371889] [2022-11-02 20:40:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:01,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-11-02 20:40:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493371889] [2022-11-02 20:40:01,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493371889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:01,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:01,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532112744] [2022-11-02 20:40:01,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:01,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:01,859 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-11-02 20:40:01,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 297 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:01,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:01,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-11-02 20:40:01,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:06,349 INFO L130 PetriNetUnfolder]: 4678/24947 cut-off events. [2022-11-02 20:40:06,350 INFO L131 PetriNetUnfolder]: For 1718/1748 co-relation queries the response was YES. [2022-11-02 20:40:06,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36842 conditions, 24947 events. 4678/24947 cut-off events. For 1718/1748 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 350907 event pairs, 977 based on Foata normal form. 0/21371 useless extension candidates. Maximal degree in co-relation 21827. Up to 4629 conditions per place. [2022-11-02 20:40:06,658 INFO L137 encePairwiseOnDemand]: 296/323 looper letters, 53 selfloop transitions, 20 changer transitions 0/321 dead transitions. [2022-11-02 20:40:06,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 321 transitions, 943 flow [2022-11-02 20:40:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-11-02 20:40:06,663 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-11-02 20:40:06,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-11-02 20:40:06,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-11-02 20:40:06,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:06,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-11-02 20:40:06,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:06,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:06,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:06,672 INFO L175 Difference]: Start difference. First operand has 281 places, 297 transitions, 747 flow. Second operand 3 states and 825 transitions. [2022-11-02 20:40:06,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 321 transitions, 943 flow [2022-11-02 20:40:06,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 321 transitions, 925 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:06,703 INFO L231 Difference]: Finished difference. Result has 283 places, 315 transitions, 895 flow [2022-11-02 20:40:06,704 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=283, PETRI_TRANSITIONS=315} [2022-11-02 20:40:06,705 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -17 predicate places. [2022-11-02 20:40:06,706 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 315 transitions, 895 flow [2022-11-02 20:40:06,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:06,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:06,707 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:40:06,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:40:06,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:40:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1269520322, now seen corresponding path program 1 times [2022-11-02 20:40:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154191193] [2022-11-02 20:40:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154191193] [2022-11-02 20:40:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154191193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:06,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:06,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476172825] [2022-11-02 20:40:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:06,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:06,839 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-11-02 20:40:06,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 315 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:06,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:40:06,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-11-02 20:40:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:40:09,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), 107#L767-12true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:09,992 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,992 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,992 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,992 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 107#L767-12true, 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:09,993 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,993 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,994 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:09,994 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:40:10,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 198#L766-12true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,071 INFO L383 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,071 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,071 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,071 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-02 20:40:10,094 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,094 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,094 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,094 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-02 20:40:10,096 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,096 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,096 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,096 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:40:10,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 10#L771-4true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,293 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,293 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,293 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,293 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 10#L771-4true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,294 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,294 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,294 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,295 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 227#L767-7true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,297 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,297 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,298 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,298 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,299 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 227#L767-7true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,299 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,299 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,299 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,300 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:40:10,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 304#L771-5true, 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,623 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,623 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,624 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,624 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 304#L771-5true, 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,626 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,626 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,626 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,626 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 64#L767-8true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,629 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,629 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,630 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,630 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][222], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 64#L767-8true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,631 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,631 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,632 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,632 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:40:10,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 55#qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-02 20:40:10,723 INFO L383 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-11-02 20:40:10,723 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,724 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,724 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:40:10,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), 107#L767-12true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,733 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-02 20:40:10,733 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 20:40:10,733 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 20:40:10,733 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 20:40:10,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 10#L771-4true, 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:10,734 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-02 20:40:10,734 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:10,734 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:10,734 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 176#qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-02 20:40:11,085 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-02 20:40:11,085 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-02 20:40:11,086 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-02 20:40:11,086 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-02 20:40:11,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L739-->L739-3: Formula: (let ((.cse0 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|)) (.cse2 (= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|)) (.cse1 (<= |v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= v_~ctr2~0_Out_6 v_~ctr2~0_In_3) .cse0 (= |v_#race~ctr2~0_Out_10| |v_#race~ctr2~0_In_1|) .cse1 (= v_~ctr1~0_In_5 (+ v_~ctr1~0_Out_2 1)) .cse2) (and .cse0 (= v_~ctr1~0_Out_2 v_~ctr1~0_In_5) (= |v_#race~ctr1~0_In_5| |v_#race~ctr1~0_Out_10|) .cse2 (not .cse1) (= (+ v_~ctr2~0_Out_6 1) v_~ctr2~0_In_3)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_5|, ~ctr1~0=v_~ctr1~0_In_5, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, #race~ctr2~0=|v_#race~ctr2~0_In_1|, ~ctr2~0=v_~ctr2~0_In_3} OutVars{qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_10|, #race~ctr2~0=|v_#race~ctr2~0_Out_10|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_2, qrcu_reader1Thread1of1ForFork1_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork1_~myidx~0#1_11|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr2~0=v_~ctr2~0_Out_6} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr1~0, #race~ctr2~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1, ~ctr2~0][112], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), 70#L771-9true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 246#L739-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:11,125 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-02 20:40:11,125 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:40:11,125 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:40:11,125 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:40:11,415 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-02 20:40:11,415 INFO L383 tUnfolder$Statistics]: this new event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,415 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,415 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,415 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1441] L769-1-->L777-2: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_2| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_~readerstart1~0#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_2| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= |v_#race~readerprogress1~0_In_3| |v_#race~readerprogress1~0_Out_6|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|)) InVars {#race~readerprogress1~0=|v_#race~readerprogress1~0_In_3|, qrcu_updaterThread1of1ForFork0_~readerstart1~0#1=|v_qrcu_updaterThread1of1ForFork0_~readerstart1~0#1_5|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} OutVars{#race~readerprogress1~0=|v_#race~readerprogress1~0_Out_6|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_2|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0_~readerstart1~0#1=|v_qrcu_updaterThread1of1ForFork0_~readerstart1~0#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~short14#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~short14#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_2|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet13#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet13#1_3|} AuxVars[] AssignedVars[#race~readerprogress1~0, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~short14#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet13#1][205], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 355#true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 192#L744-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 65#L725-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 301#L777-2true, 98#L786-4true, 357#(= |#race~ctr2~0| 0), qrcu_updaterThread1of1ForFork0InUse]) [2022-11-02 20:40:11,466 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:40:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 20:40:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:40:11,510 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 227#L767-7true, 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:11,510 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,510 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,510 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,510 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:40:11,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 304#L771-5true, 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:11,694 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,694 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,694 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,694 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 64#L767-8true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:11,696 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [130#qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACEtrue, Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:11,776 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-02 20:40:11,776 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,776 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:11,776 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:40:12,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 230#qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-02 20:40:12,188 INFO L383 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-11-02 20:40:12,188 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:12,188 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:12,188 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:40:12,397 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 320#(= |#race~idx~0| 0), 240#L772-15true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,397 INFO L383 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,397 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,397 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,397 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 320#(= |#race~idx~0| 0), 361#true, Black: 357#(= |#race~ctr2~0| 0), 157#L772-16true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,541 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,541 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,541 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,541 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,542 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 320#(= |#race~idx~0| 0), 240#L772-15true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,543 INFO L383 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,543 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,543 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,543 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,543 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:40:12,567 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][227], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 320#(= |#race~idx~0| 0), 361#true, Black: 357#(= |#race~ctr2~0| 0), 157#L772-16true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,567 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,567 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,567 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,567 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,567 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 320#(= |#race~idx~0| 0), 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 124#qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACEtrue, 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,626 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-02 20:40:12,626 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,627 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,627 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:40:12,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1396] L758-->L758-3: Formula: (let ((.cse0 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|)) (.cse1 (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|)) (.cse2 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9| 0))) (or (and (= (+ v_~ctr1~0_Out_6 1) v_~ctr1~0_In_7) .cse0 .cse1 .cse2 (= v_~ctr2~0_Out_10 v_~ctr2~0_In_5) (= |v_#race~ctr2~0_Out_14| |v_#race~ctr2~0_In_3|)) (and .cse0 (= v_~ctr2~0_In_5 (+ v_~ctr2~0_Out_10 1)) .cse1 (not .cse2) (= |v_#race~ctr1~0_In_7| |v_#race~ctr1~0_Out_14|) (= v_~ctr1~0_Out_6 v_~ctr1~0_In_7)))) InVars {#race~ctr1~0=|v_#race~ctr1~0_In_7|, ~ctr1~0=v_~ctr1~0_In_7, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_In_3|, ~ctr2~0=v_~ctr2~0_In_5} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1_9|, #race~ctr1~0=|v_#race~ctr1~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_9|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_9|, #race~ctr2~0=|v_#race~ctr2~0_Out_14|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1_9|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_9|, ~ctr1~0=v_~ctr1~0_Out_6, ~ctr2~0=v_~ctr2~0_Out_10} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post9#1, #race~ctr1~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, #race~ctr2~0, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet10#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post11#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][130], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 361#true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 133#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 195#L758-3true, 46#qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACEtrue, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-02 20:40:12,723 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-02 20:40:12,723 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:40:12,723 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:40:12,723 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:40:12,744 INFO L130 PetriNetUnfolder]: 7828/38531 cut-off events. [2022-11-02 20:40:12,744 INFO L131 PetriNetUnfolder]: For 10353/11163 co-relation queries the response was YES. [2022-11-02 20:40:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67074 conditions, 38531 events. 7828/38531 cut-off events. For 10353/11163 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 571876 event pairs, 1351 based on Foata normal form. 75/34314 useless extension candidates. Maximal degree in co-relation 23906. Up to 7695 conditions per place. [2022-11-02 20:40:13,136 INFO L137 encePairwiseOnDemand]: 296/323 looper letters, 59 selfloop transitions, 22 changer transitions 0/343 dead transitions. [2022-11-02 20:40:13,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 343 transitions, 1139 flow [2022-11-02 20:40:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:40:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-11-02 20:40:13,140 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-11-02 20:40:13,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-11-02 20:40:13,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-11-02 20:40:13,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:40:13,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-11-02 20:40:13,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:13,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:13,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:13,147 INFO L175 Difference]: Start difference. First operand has 283 places, 315 transitions, 895 flow. Second operand 3 states and 825 transitions. [2022-11-02 20:40:13,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 343 transitions, 1139 flow [2022-11-02 20:40:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 343 transitions, 1091 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:40:13,200 INFO L231 Difference]: Finished difference. Result has 285 places, 335 transitions, 1045 flow [2022-11-02 20:40:13,201 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=285, PETRI_TRANSITIONS=335} [2022-11-02 20:40:13,202 INFO L287 CegarLoopForPetriNet]: 300 programPoint places, -15 predicate places. [2022-11-02 20:40:13,202 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 335 transitions, 1045 flow [2022-11-02 20:40:13,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:13,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:40:13,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:13,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:40:13,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-11-02 20:40:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1636986432, now seen corresponding path program 1 times [2022-11-02 20:40:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:13,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629240045] [2022-11-02 20:40:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:40:13,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:40:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:40:13,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:40:13,509 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:40:13,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (109 of 110 remaining) [2022-11-02 20:40:13,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (108 of 110 remaining) [2022-11-02 20:40:13,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (107 of 110 remaining) [2022-11-02 20:40:13,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (106 of 110 remaining) [2022-11-02 20:40:13,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (105 of 110 remaining) [2022-11-02 20:40:13,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (104 of 110 remaining) [2022-11-02 20:40:13,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (103 of 110 remaining) [2022-11-02 20:40:13,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (102 of 110 remaining) [2022-11-02 20:40:13,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (101 of 110 remaining) [2022-11-02 20:40:13,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (100 of 110 remaining) [2022-11-02 20:40:13,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (99 of 110 remaining) [2022-11-02 20:40:13,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (98 of 110 remaining) [2022-11-02 20:40:13,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (97 of 110 remaining) [2022-11-02 20:40:13,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (96 of 110 remaining) [2022-11-02 20:40:13,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (95 of 110 remaining) [2022-11-02 20:40:13,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (94 of 110 remaining) [2022-11-02 20:40:13,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (93 of 110 remaining) [2022-11-02 20:40:13,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (92 of 110 remaining) [2022-11-02 20:40:13,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (91 of 110 remaining) [2022-11-02 20:40:13,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (90 of 110 remaining) [2022-11-02 20:40:13,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (89 of 110 remaining) [2022-11-02 20:40:13,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (88 of 110 remaining) [2022-11-02 20:40:13,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (87 of 110 remaining) [2022-11-02 20:40:13,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (86 of 110 remaining) [2022-11-02 20:40:13,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (85 of 110 remaining) [2022-11-02 20:40:13,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (84 of 110 remaining) [2022-11-02 20:40:13,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (83 of 110 remaining) [2022-11-02 20:40:13,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (82 of 110 remaining) [2022-11-02 20:40:13,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (81 of 110 remaining) [2022-11-02 20:40:13,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (80 of 110 remaining) [2022-11-02 20:40:13,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (79 of 110 remaining) [2022-11-02 20:40:13,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (78 of 110 remaining) [2022-11-02 20:40:13,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (77 of 110 remaining) [2022-11-02 20:40:13,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (76 of 110 remaining) [2022-11-02 20:40:13,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (75 of 110 remaining) [2022-11-02 20:40:13,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (74 of 110 remaining) [2022-11-02 20:40:13,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (73 of 110 remaining) [2022-11-02 20:40:13,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (72 of 110 remaining) [2022-11-02 20:40:13,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (71 of 110 remaining) [2022-11-02 20:40:13,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (70 of 110 remaining) [2022-11-02 20:40:13,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (69 of 110 remaining) [2022-11-02 20:40:13,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (68 of 110 remaining) [2022-11-02 20:40:13,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (67 of 110 remaining) [2022-11-02 20:40:13,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (66 of 110 remaining) [2022-11-02 20:40:13,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (65 of 110 remaining) [2022-11-02 20:40:13,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (64 of 110 remaining) [2022-11-02 20:40:13,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (63 of 110 remaining) [2022-11-02 20:40:13,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (62 of 110 remaining) [2022-11-02 20:40:13,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (61 of 110 remaining) [2022-11-02 20:40:13,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (60 of 110 remaining) [2022-11-02 20:40:13,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (59 of 110 remaining) [2022-11-02 20:40:13,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (58 of 110 remaining) [2022-11-02 20:40:13,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (57 of 110 remaining) [2022-11-02 20:40:13,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 110 remaining) [2022-11-02 20:40:13,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 110 remaining) [2022-11-02 20:40:13,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 110 remaining) [2022-11-02 20:40:13,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 110 remaining) [2022-11-02 20:40:13,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 110 remaining) [2022-11-02 20:40:13,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 110 remaining) [2022-11-02 20:40:13,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (50 of 110 remaining) [2022-11-02 20:40:13,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (49 of 110 remaining) [2022-11-02 20:40:13,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (48 of 110 remaining) [2022-11-02 20:40:13,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (47 of 110 remaining) [2022-11-02 20:40:13,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (46 of 110 remaining) [2022-11-02 20:40:13,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (45 of 110 remaining) [2022-11-02 20:40:13,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (44 of 110 remaining) [2022-11-02 20:40:13,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (43 of 110 remaining) [2022-11-02 20:40:13,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (42 of 110 remaining) [2022-11-02 20:40:13,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (41 of 110 remaining) [2022-11-02 20:40:13,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (40 of 110 remaining) [2022-11-02 20:40:13,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (39 of 110 remaining) [2022-11-02 20:40:13,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (38 of 110 remaining) [2022-11-02 20:40:13,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (37 of 110 remaining) [2022-11-02 20:40:13,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (36 of 110 remaining) [2022-11-02 20:40:13,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (35 of 110 remaining) [2022-11-02 20:40:13,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (34 of 110 remaining) [2022-11-02 20:40:13,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (33 of 110 remaining) [2022-11-02 20:40:13,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (32 of 110 remaining) [2022-11-02 20:40:13,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (31 of 110 remaining) [2022-11-02 20:40:13,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (30 of 110 remaining) [2022-11-02 20:40:13,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (29 of 110 remaining) [2022-11-02 20:40:13,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (28 of 110 remaining) [2022-11-02 20:40:13,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (27 of 110 remaining) [2022-11-02 20:40:13,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (26 of 110 remaining) [2022-11-02 20:40:13,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (25 of 110 remaining) [2022-11-02 20:40:13,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (24 of 110 remaining) [2022-11-02 20:40:13,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (23 of 110 remaining) [2022-11-02 20:40:13,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (22 of 110 remaining) [2022-11-02 20:40:13,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (21 of 110 remaining) [2022-11-02 20:40:13,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (20 of 110 remaining) [2022-11-02 20:40:13,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (19 of 110 remaining) [2022-11-02 20:40:13,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (18 of 110 remaining) [2022-11-02 20:40:13,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (17 of 110 remaining) [2022-11-02 20:40:13,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (16 of 110 remaining) [2022-11-02 20:40:13,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (15 of 110 remaining) [2022-11-02 20:40:13,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (14 of 110 remaining) [2022-11-02 20:40:13,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (13 of 110 remaining) [2022-11-02 20:40:13,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (12 of 110 remaining) [2022-11-02 20:40:13,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (11 of 110 remaining) [2022-11-02 20:40:13,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (10 of 110 remaining) [2022-11-02 20:40:13,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (9 of 110 remaining) [2022-11-02 20:40:13,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (8 of 110 remaining) [2022-11-02 20:40:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (7 of 110 remaining) [2022-11-02 20:40:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (6 of 110 remaining) [2022-11-02 20:40:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (5 of 110 remaining) [2022-11-02 20:40:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (4 of 110 remaining) [2022-11-02 20:40:13,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (3 of 110 remaining) [2022-11-02 20:40:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (2 of 110 remaining) [2022-11-02 20:40:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (1 of 110 remaining) [2022-11-02 20:40:13,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (0 of 110 remaining) [2022-11-02 20:40:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:40:13,557 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:13,566 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:40:13,566 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:40:13,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:40:13 BasicIcfg [2022-11-02 20:40:13,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:40:13,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:40:13,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:40:13,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:40:13,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:39:40" (3/4) ... [2022-11-02 20:40:13,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:40:13,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:40:13,693 INFO L158 Benchmark]: Toolchain (without parser) took 36663.99ms. Allocated memory was 81.8MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 41.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-02 20:40:13,693 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 81.8MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:40:13,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 916.02ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 41.6MB in the beginning and 85.7MB in the end (delta: -44.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-02 20:40:13,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.70ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 82.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:40:13,695 INFO L158 Benchmark]: Boogie Preprocessor took 77.40ms. Allocated memory is still 119.5MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:40:13,695 INFO L158 Benchmark]: RCFGBuilder took 1927.15ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 88.6MB in the end (delta: -8.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2022-11-02 20:40:13,696 INFO L158 Benchmark]: TraceAbstraction took 33594.52ms. Allocated memory was 119.5MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 88.6MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-02 20:40:13,696 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 10.7GB. Free memory is still 9.7GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:40:13,700 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 81.8MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 916.02ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 41.6MB in the beginning and 85.7MB in the end (delta: -44.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.70ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 82.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.40ms. Allocated memory is still 119.5MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1927.15ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 88.6MB in the end (delta: -8.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33594.52ms. Allocated memory was 119.5MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 88.6MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 10.7GB. Free memory is still 9.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 737]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int idx=0; VAL [idx=0] [L690] 0 int ctr1=1, ctr2=0; VAL [ctr1=1, ctr2=0, idx=0] [L691] 0 int readerprogress1=0, readerprogress2=0; VAL [ctr1=1, ctr2=0, idx=0, readerprogress1=0, readerprogress2=0] [L692] 0 pthread_mutex_t mutex; VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L782] 0 pthread_t t1, t2, t3; VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L784] FCALL, FORK 0 pthread_create(&t1, 0, qrcu_reader1, 0) VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, pthread_create(&t1, 0, qrcu_reader1, 0)=-2, readerprogress1=0, readerprogress2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L724] 1 int myidx; VAL [arg={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L725] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L726] 1 myidx = idx VAL [arg={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=0, readerprogress2=0] [L727] COND TRUE 1 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, arg={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=0, readerprogress2=0] [L728] CALL 1 __VERIFIER_atomic_use1(myidx) [L694] EXPR 1 myidx <= 0 && ctr1>0 [L694] EXPR 1 ctr1>0 [L694] EXPR 1 myidx <= 0 && ctr1>0 [L694] CALL 1 assume_abort_if_not(myidx <= 0 && ctr1>0) [L3] COND FALSE 1 !(!cond) [L694] RET 1 assume_abort_if_not(myidx <= 0 && ctr1>0) [L695] 1 ctr1++ [L728] RET 1 __VERIFIER_atomic_use1(myidx) [L737] 1 readerprogress1 = 1 VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=1, readerprogress1 = 1=49, readerprogress2=0] [L785] FCALL, FORK 0 pthread_create(&t2, 0, qrcu_reader2, 0) VAL [ctr1=2, ctr2=0, idx=0, mutex={3:0}, pthread_create(&t2, 0, qrcu_reader2, 0)=-1, readerprogress1=1, readerprogress2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L786] FCALL, FORK 0 pthread_create(&t3, 0, qrcu_updater, 0) VAL [ctr1=2, ctr2=0, idx=0, mutex={3:0}, pthread_create(&t3, 0, qrcu_updater, 0)=0, readerprogress1=1, readerprogress2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L762] 3 int i; VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0] [L763] 3 int readerstart1=__VERIFIER_nondet_int(), readerstart2=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0] [L763] 3 int readerstart1=__VERIFIER_nondet_int(), readerstart2=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0, readerstart2=0] [L764] 3 int sum; VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0, readerstart2=0] [L765] CALL 3 __VERIFIER_atomic_take_snapshot(readerstart1, readerstart2) [L706] 3 readerstart1 = readerprogress1 [L707] 3 readerstart2 = readerprogress2 [L765] RET 3 __VERIFIER_atomic_take_snapshot(readerstart1, readerstart2) [L737] 1 readerprogress1 = 1 VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=1, readerprogress1 = 1=49, readerprogress2=0] Now there is a data race on ~readerprogress1~0 between C: readerstart1 = readerprogress1 [706] and C: readerprogress1 = 1 [737] - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 531 locations, 110 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 90 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1045occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:40:13,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c540dda8-9887-4999-9016-8e0533345689/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE