./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/qrcu-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a --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-b5237d8 [2022-11-21 16:16:47,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:16:47,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:16:47,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:16:47,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:16:47,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:16:47,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:16:47,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:16:47,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:16:47,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:16:47,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:16:47,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:16:47,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:16:47,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:16:47,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:16:47,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:16:47,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:16:47,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:16:47,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:16:47,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:16:47,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:16:47,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:16:47,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:16:47,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:16:47,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:16:47,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:16:47,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:16:47,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:16:47,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:16:47,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:16:47,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:16:47,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:16:47,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:16:47,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:16:47,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:16:47,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:16:47,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:16:47,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:16:47,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:16:47,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:16:47,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:16:47,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 16:16:47,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:16:47,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:16:47,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:16:47,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:16:47,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:16:47,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:16:47,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:16:47,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:16:47,422 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:16:47,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:16:47,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:16:47,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:16:47,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:16:47,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:16:47,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:16:47,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:16:47,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:16:47,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:16:47,425 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 16:16:47,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:16:47,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:16:47,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:16:47,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:16:47,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:16:47,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:16:47,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:16:47,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:16:47,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:16:47,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:16:47,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:16:47,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:16:47,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:16:47,429 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:16:47,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:16:47,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:16:47,429 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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a 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-21 16:16:47,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:16:47,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:16:47,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:16:47,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:16:47,741 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:16:47,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-atomic/qrcu-2.i [2022-11-21 16:16:50,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:16:51,143 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:16:51,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/sv-benchmarks/c/pthread-atomic/qrcu-2.i [2022-11-21 16:16:51,160 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/data/0199b9dd1/c1d49919649c485cb32835bf369d576a/FLAGa9fddb952 [2022-11-21 16:16:51,183 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/data/0199b9dd1/c1d49919649c485cb32835bf369d576a [2022-11-21 16:16:51,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:16:51,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:16:51,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:16:51,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:16:51,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:16:51,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657bcfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51, skipping insertion in model container [2022-11-21 16:16:51,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:16:51,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:16:51,699 WARN L237 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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30690,30703] [2022-11-21 16:16:51,704 WARN L237 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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30912,30925] [2022-11-21 16:16:51,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:16:51,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:16:51,798 WARN L237 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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30690,30703] [2022-11-21 16:16:51,799 WARN L237 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_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/sv-benchmarks/c/pthread-atomic/qrcu-2.i[30912,30925] [2022-11-21 16:16:51,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:16:51,867 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:16:51,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51 WrapperNode [2022-11-21 16:16:51,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:16:51,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:16:51,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:16:51,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:16:51,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,952 INFO L138 Inliner]: procedures = 177, calls = 44, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 441 [2022-11-21 16:16:51,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:16:51,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:16:51,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:16:51,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:16:51,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:51,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:52,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:52,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:16:52,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:16:52,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:16:52,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:16:52,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (1/1) ... [2022-11-21 16:16:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:16:52,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:52,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:16:52,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:16:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-11-21 16:16:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-11-21 16:16:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-11-21 16:16:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-11-21 16:16:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:16:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:16:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-11-21 16:16:52,114 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-11-21 16:16:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 16:16:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:16:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:16:52,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:16:52,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:16:52,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:16:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:16:52,117 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:16:52,277 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:16:52,279 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:16:53,121 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:16:53,463 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:16:53,463 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:16:53,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:16:53 BoogieIcfgContainer [2022-11-21 16:16:53,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:16:53,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:16:53,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:16:53,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:16:53,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:16:51" (1/3) ... [2022-11-21 16:16:53,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d426dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:16:53, skipping insertion in model container [2022-11-21 16:16:53,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:51" (2/3) ... [2022-11-21 16:16:53,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d426dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:16:53, skipping insertion in model container [2022-11-21 16:16:53,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:16:53" (3/3) ... [2022-11-21 16:16:53,478 INFO L112 eAbstractionObserver]: Analyzing ICFG qrcu-2.i [2022-11-21 16:16:53,492 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:16:53,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:16:53,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-11-21 16:16:53,504 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:16:53,672 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 16:16:53,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 323 transitions, 670 flow [2022-11-21 16:16:53,894 INFO L130 PetriNetUnfolder]: 18/320 cut-off events. [2022-11-21 16:16:53,894 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:16:53,906 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 911 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-21 16:16:53,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 323 transitions, 670 flow [2022-11-21 16:16:53,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 308 transitions, 631 flow [2022-11-21 16:16:53,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:16:53,935 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;@4bb300b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:16:53,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 110 error locations. [2022-11-21 16:16:53,944 INFO L130 PetriNetUnfolder]: 1/45 cut-off events. [2022-11-21 16:16:53,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:16:53,944 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:53,945 INFO L209 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-21 16:16:53,945 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-21 16:16:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash 793044900, now seen corresponding path program 1 times [2022-11-21 16:16:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:53,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861303685] [2022-11-21 16:16:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:54,242 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-21 16:16:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:54,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861303685] [2022-11-21 16:16:54,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861303685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:54,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:54,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:16:54,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702371647] [2022-11-21 16:16:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:54,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:16:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:16:54,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:16:54,295 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-11-21 16:16:54,302 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-21 16:16:54,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:54,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-11-21 16:16:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:56,072 INFO L130 PetriNetUnfolder]: 1878/7749 cut-off events. [2022-11-21 16:16:56,072 INFO L131 PetriNetUnfolder]: For 439/439 co-relation queries the response was YES. [2022-11-21 16:16:56,117 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 78181 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-21 16:16:56,217 INFO L137 encePairwiseOnDemand]: 281/323 looper letters, 45 selfloop transitions, 8 changer transitions 0/299 dead transitions. [2022-11-21 16:16:56,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 299 transitions, 731 flow [2022-11-21 16:16:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:16:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:16:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2022-11-21 16:16:56,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9236326109391125 [2022-11-21 16:16:56,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2022-11-21 16:16:56,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2022-11-21 16:16:56,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:56,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2022-11-21 16:16:56,255 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-21 16:16:56,265 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-21 16:16:56,266 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-21 16:16:56,268 INFO L175 Difference]: Start difference. First operand has 300 places, 308 transitions, 631 flow. Second operand 3 states and 895 transitions. [2022-11-21 16:16:56,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 299 transitions, 731 flow [2022-11-21 16:16:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 299 transitions, 715 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 16:16:56,286 INFO L231 Difference]: Finished difference. Result has 273 places, 282 transitions, 618 flow [2022-11-21 16:16:56,289 INFO L271 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-21 16:16:56,295 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -27 predicate places. [2022-11-21 16:16:56,295 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 618 flow [2022-11-21 16:16:56,296 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-21 16:16:56,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:56,297 INFO L209 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-21 16:16:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:16:56,297 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-21 16:16:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1529989037, now seen corresponding path program 1 times [2022-11-21 16:16:56,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:56,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055457062] [2022-11-21 16:16:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:56,409 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-21 16:16:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:56,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055457062] [2022-11-21 16:16:56,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055457062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:56,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:56,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:16:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452147882] [2022-11-21 16:16:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:56,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:16:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:16:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:16:56,414 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-21 16:16:56,416 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-21 16:16:56,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:56,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-21 16:16:56,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:57,562 INFO L130 PetriNetUnfolder]: 1129/5556 cut-off events. [2022-11-21 16:16:57,563 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-11-21 16:16:57,597 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 55699 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-21 16:16:57,628 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 28 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-11-21 16:16:57,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 292 transitions, 705 flow [2022-11-21 16:16:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:16:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:16:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-21 16:16:57,631 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-21 16:16:57,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-21 16:16:57,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-21 16:16:57,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:57,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-21 16:16:57,635 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-21 16:16:57,637 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-21 16:16:57,638 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-21 16:16:57,638 INFO L175 Difference]: Start difference. First operand has 273 places, 282 transitions, 618 flow. Second operand 3 states and 843 transitions. [2022-11-21 16:16:57,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 292 transitions, 705 flow [2022-11-21 16:16:57,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 292 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:16:57,648 INFO L231 Difference]: Finished difference. Result has 275 places, 285 transitions, 632 flow [2022-11-21 16:16:57,648 INFO L271 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-21 16:16:57,649 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -25 predicate places. [2022-11-21 16:16:57,650 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 632 flow [2022-11-21 16:16:57,650 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-21 16:16:57,650 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:57,651 INFO L209 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-21 16:16:57,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:16:57,651 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-21 16:16:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash 66168034, now seen corresponding path program 1 times [2022-11-21 16:16:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:57,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985980228] [2022-11-21 16:16:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:57,745 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-21 16:16:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:57,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985980228] [2022-11-21 16:16:57,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985980228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:57,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:57,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:16:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724221900] [2022-11-21 16:16:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:57,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:16:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:16:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:16:57,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-21 16:16:57,752 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-21 16:16:57,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:57,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-21 16:16:57,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:59,090 INFO L130 PetriNetUnfolder]: 1240/6639 cut-off events. [2022-11-21 16:16:59,090 INFO L131 PetriNetUnfolder]: For 293/345 co-relation queries the response was YES. [2022-11-21 16:16:59,144 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 69965 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-21 16:16:59,180 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-21 16:16:59,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 295 transitions, 725 flow [2022-11-21 16:16:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:16:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:16:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-21 16:16:59,185 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-21 16:16:59,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-21 16:16:59,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-21 16:16:59,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:59,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-21 16:16:59,188 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-21 16:16:59,190 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-21 16:16:59,191 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-21 16:16:59,191 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 632 flow. Second operand 3 states and 843 transitions. [2022-11-21 16:16:59,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 295 transitions, 725 flow [2022-11-21 16:16:59,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 295 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:16:59,200 INFO L231 Difference]: Finished difference. Result has 277 places, 288 transitions, 656 flow [2022-11-21 16:16:59,200 INFO L271 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-21 16:16:59,202 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -23 predicate places. [2022-11-21 16:16:59,202 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 288 transitions, 656 flow [2022-11-21 16:16:59,202 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-21 16:16:59,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:59,203 INFO L209 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-21 16:16:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:16:59,203 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-21 16:16:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1919312747, now seen corresponding path program 1 times [2022-11-21 16:16:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:59,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705261306] [2022-11-21 16:16:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:59,331 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-21 16:16:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:59,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705261306] [2022-11-21 16:16:59,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705261306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:59,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:59,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:16:59,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535117271] [2022-11-21 16:16:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:59,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:16:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:16:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:16:59,336 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-21 16:16:59,337 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-21 16:16:59,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:59,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-21 16:16:59,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:01,280 INFO L130 PetriNetUnfolder]: 1724/10617 cut-off events. [2022-11-21 16:17:01,280 INFO L131 PetriNetUnfolder]: For 569/602 co-relation queries the response was YES. [2022-11-21 16:17:01,376 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 126418 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-21 16:17:01,439 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 6 changer transitions 0/300 dead transitions. [2022-11-21 16:17:01,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 300 transitions, 767 flow [2022-11-21 16:17:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:17:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:17:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-21 16:17:01,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-21 16:17:01,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-21 16:17:01,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-21 16:17:01,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:01,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-21 16:17:01,446 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-21 16:17:01,449 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-21 16:17:01,450 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-21 16:17:01,450 INFO L175 Difference]: Start difference. First operand has 277 places, 288 transitions, 656 flow. Second operand 3 states and 843 transitions. [2022-11-21 16:17:01,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 300 transitions, 767 flow [2022-11-21 16:17:01,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 300 transitions, 753 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-21 16:17:01,466 INFO L231 Difference]: Finished difference. Result has 279 places, 293 transitions, 700 flow [2022-11-21 16:17:01,466 INFO L271 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-21 16:17:01,468 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -21 predicate places. [2022-11-21 16:17:01,468 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 293 transitions, 700 flow [2022-11-21 16:17:01,469 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-21 16:17:01,469 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:01,470 INFO L209 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-21 16:17:01,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:17:01,470 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-21 16:17:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1696456880, now seen corresponding path program 1 times [2022-11-21 16:17:01,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:01,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069781208] [2022-11-21 16:17:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:01,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:02,172 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-21 16:17:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069781208] [2022-11-21 16:17:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069781208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:17:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400853326] [2022-11-21 16:17:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:17:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:02,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:17:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:17:02,179 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 323 [2022-11-21 16:17:02,181 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-21 16:17:02,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:02,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 323 [2022-11-21 16:17:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:07,613 INFO L130 PetriNetUnfolder]: 7975/43722 cut-off events. [2022-11-21 16:17:07,613 INFO L131 PetriNetUnfolder]: For 3125/3160 co-relation queries the response was YES. [2022-11-21 16:17:07,838 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 668472 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-21 16:17:08,029 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 92 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2022-11-21 16:17:08,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 348 transitions, 1138 flow [2022-11-21 16:17:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:17:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:17:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2022-11-21 16:17:08,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-11-21 16:17:08,033 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2022-11-21 16:17:08,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2022-11-21 16:17:08,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:08,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2022-11-21 16:17:08,038 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-21 16:17:08,042 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-21 16:17:08,044 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-21 16:17:08,044 INFO L175 Difference]: Start difference. First operand has 279 places, 293 transitions, 700 flow. Second operand 6 states and 1596 transitions. [2022-11-21 16:17:08,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 348 transitions, 1138 flow [2022-11-21 16:17:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 348 transitions, 1102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:17:08,060 INFO L231 Difference]: Finished difference. Result has 281 places, 292 transitions, 694 flow [2022-11-21 16:17:08,060 INFO L271 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-21 16:17:08,061 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-11-21 16:17:08,061 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 292 transitions, 694 flow [2022-11-21 16:17:08,063 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-21 16:17:08,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:08,063 INFO L209 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-21 16:17:08,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:17:08,063 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-21 16:17:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1949272664, now seen corresponding path program 1 times [2022-11-21 16:17:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:08,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646096473] [2022-11-21 16:17:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:08,107 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-21 16:17:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:08,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646096473] [2022-11-21 16:17:08,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646096473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:08,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:08,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:17:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071763137] [2022-11-21 16:17:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:08,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:17:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:17:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:17:08,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-11-21 16:17:08,112 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-21 16:17:08,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:08,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-11-21 16:17:08,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:10,291 INFO L130 PetriNetUnfolder]: 1966/13267 cut-off events. [2022-11-21 16:17:10,291 INFO L131 PetriNetUnfolder]: For 1045/1205 co-relation queries the response was YES. [2022-11-21 16:17:10,354 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 167156 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-21 16:17:10,414 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 34 selfloop transitions, 6 changer transitions 0/304 dead transitions. [2022-11-21 16:17:10,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 304 transitions, 815 flow [2022-11-21 16:17:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:17:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:17:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-11-21 16:17:10,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-11-21 16:17:10,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-11-21 16:17:10,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-11-21 16:17:10,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:10,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-11-21 16:17:10,421 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-21 16:17:10,423 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-21 16:17:10,424 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-21 16:17:10,424 INFO L175 Difference]: Start difference. First operand has 281 places, 292 transitions, 694 flow. Second operand 3 states and 843 transitions. [2022-11-21 16:17:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 304 transitions, 815 flow [2022-11-21 16:17:10,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 304 transitions, 808 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:17:10,433 INFO L231 Difference]: Finished difference. Result has 281 places, 297 transitions, 747 flow [2022-11-21 16:17:10,433 INFO L271 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-21 16:17:10,434 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-11-21 16:17:10,434 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 297 transitions, 747 flow [2022-11-21 16:17:10,435 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-21 16:17:10,435 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:10,435 INFO L209 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-21 16:17:10,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:17:10,436 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-21 16:17:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1269489537, now seen corresponding path program 1 times [2022-11-21 16:17:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370768961] [2022-11-21 16:17:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:10,485 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-21 16:17:10,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370768961] [2022-11-21 16:17:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370768961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:10,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:10,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:17:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190859827] [2022-11-21 16:17:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:10,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:17:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:10,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:17:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:17:10,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-11-21 16:17:10,490 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-21 16:17:10,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:10,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-11-21 16:17:10,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:13,941 INFO L130 PetriNetUnfolder]: 4680/24941 cut-off events. [2022-11-21 16:17:13,942 INFO L131 PetriNetUnfolder]: For 1714/1744 co-relation queries the response was YES. [2022-11-21 16:17:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36824 conditions, 24941 events. 4680/24941 cut-off events. For 1714/1744 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 350591 event pairs, 973 based on Foata normal form. 0/21365 useless extension candidates. Maximal degree in co-relation 21855. Up to 4629 conditions per place. [2022-11-21 16:17:14,163 INFO L137 encePairwiseOnDemand]: 296/323 looper letters, 53 selfloop transitions, 20 changer transitions 0/321 dead transitions. [2022-11-21 16:17:14,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 321 transitions, 943 flow [2022-11-21 16:17:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:17:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:17:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-11-21 16:17:14,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-11-21 16:17:14,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-11-21 16:17:14,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-11-21 16:17:14,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:14,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-11-21 16:17:14,183 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-21 16:17:14,189 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-21 16:17:14,190 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-21 16:17:14,190 INFO L175 Difference]: Start difference. First operand has 281 places, 297 transitions, 747 flow. Second operand 3 states and 825 transitions. [2022-11-21 16:17:14,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 321 transitions, 943 flow [2022-11-21 16:17:14,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 321 transitions, 925 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-21 16:17:14,219 INFO L231 Difference]: Finished difference. Result has 283 places, 315 transitions, 895 flow [2022-11-21 16:17:14,219 INFO L271 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-21 16:17:14,220 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -17 predicate places. [2022-11-21 16:17:14,220 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 315 transitions, 895 flow [2022-11-21 16:17:14,221 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-21 16:17:14,221 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:14,221 INFO L209 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-21 16:17:14,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:17:14,221 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-21 16:17:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1269520322, now seen corresponding path program 1 times [2022-11-21 16:17:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:14,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732774751] [2022-11-21 16:17:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:14,292 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-21 16:17:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732774751] [2022-11-21 16:17:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732774751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:14,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:17:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359783151] [2022-11-21 16:17:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:17:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:17:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:17:14,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-11-21 16:17:14,297 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-21 16:17:14,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:14,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-11-21 16:17:14,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:17,251 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-21 16:17:17,252 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,253 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), 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,253 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,253 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,253 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,253 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-21 16:17:17,348 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 198#L766-12true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,348 INFO L383 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-11-21 16:17:17,349 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:17,349 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:17,349 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:17,370 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-21 16:17:17,371 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,373 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-21 16:17:17,373 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-21 16:17:17,643 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, 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,643 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,643 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,643 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,644 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,644 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, 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,645 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,645 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,645 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,645 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,647 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-21 16:17:17,647 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,648 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,648 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,648 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,649 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, 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,649 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,649 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,649 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,649 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-21 16:17:17,786 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, 64#L767-8true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,786 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,786 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,786 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,786 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,787 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, 64#L767-8true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,787 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,787 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,788 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,788 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,790 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,790 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,791 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:17,792 INFO L383 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,792 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,792 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:17,792 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-21 16:17:18,043 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,043 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-21 16:17:18,044 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-21 16:17:18,044 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-21 16:17:18,044 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-21 16:17:18,044 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,044 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,044 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,045 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,045 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,058 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, qrcu_updaterThread1of1ForFork0InUse, 55#qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-21 16:17:18,058 INFO L383 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-11-21 16:17:18,058 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:18,058 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:18,059 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-21 16:17:18,310 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 176#qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-21 16:17:18,310 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-21 16:17:18,310 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-21 16:17:18,311 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-21 16:17:18,311 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-21 16:17:18,317 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|), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 98#L786-4true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,317 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-21 16:17:18,318 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-21 16:17:18,318 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-21 16:17:18,318 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-21 16:17:18,569 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 163#L767-13true, 355#true]) [2022-11-21 16:17:18,569 INFO L383 tUnfolder$Statistics]: this new event has 122 ancestors and is cut-off event [2022-11-21 16:17:18,569 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:18,569 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:18,569 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:18,611 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-21 16:17:18,611 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,611 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-21 16:17:18,611 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-21 16:17:18,611 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-21 16:17:18,637 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,638 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,638 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,638 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,638 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 16:17:18,799 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 64#L767-8true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,799 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,799 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,800 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,800 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,801 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:18,801 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,801 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,801 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:18,801 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:19,049 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,050 INFO L383 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-11-21 16:17:19,050 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:19,050 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:19,050 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 16:17:19,231 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, qrcu_updaterThread1of1ForFork0InUse, 230#qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACEtrue, 355#true]) [2022-11-21 16:17:19,232 INFO L383 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-11-21 16:17:19,232 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:19,232 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:19,232 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 16:17:19,421 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, 240#L772-15true, 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,421 INFO L383 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,422 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,422 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,422 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,565 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,565 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,566 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,566 INFO L383 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,566 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,566 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,566 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,566 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 16:17:19,589 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-21 16:17:19,589 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,589 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,589 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,589 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,590 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,655 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-21 16:17:19,655 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-21 16:17:19,655 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,656 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,656 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 16:17:19,727 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, 35#L774-1true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,727 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is not cut-off event [2022-11-21 16:17:19,727 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-21 16:17:19,727 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-21 16:17:19,727 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-21 16:17:19,900 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, 71#L774-2true, 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,900 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is not cut-off event [2022-11-21 16:17:19,900 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-21 16:17:19,901 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-21 16:17:19,901 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-21 16:17:19,921 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)), 195#L758-3true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 46#qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACEtrue, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-11-21 16:17:19,921 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-21 16:17:19,922 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-21 16:17:19,925 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-21 16:17:19,926 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-21 16:17:19,942 INFO L130 PetriNetUnfolder]: 7819/38514 cut-off events. [2022-11-21 16:17:19,942 INFO L131 PetriNetUnfolder]: For 10348/11158 co-relation queries the response was YES. [2022-11-21 16:17:20,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67040 conditions, 38514 events. 7819/38514 cut-off events. For 10348/11158 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 571740 event pairs, 1395 based on Foata normal form. 75/34304 useless extension candidates. Maximal degree in co-relation 23906. Up to 7693 conditions per place. [2022-11-21 16:17:20,270 INFO L137 encePairwiseOnDemand]: 296/323 looper letters, 59 selfloop transitions, 22 changer transitions 0/343 dead transitions. [2022-11-21 16:17:20,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 343 transitions, 1139 flow [2022-11-21 16:17:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:17:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:17:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-11-21 16:17:20,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-11-21 16:17:20,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-11-21 16:17:20,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-11-21 16:17:20,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:20,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-11-21 16:17:20,275 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-21 16:17:20,277 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-21 16:17:20,278 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-21 16:17:20,278 INFO L175 Difference]: Start difference. First operand has 283 places, 315 transitions, 895 flow. Second operand 3 states and 825 transitions. [2022-11-21 16:17:20,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 343 transitions, 1139 flow [2022-11-21 16:17:20,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 343 transitions, 1091 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:17:20,328 INFO L231 Difference]: Finished difference. Result has 285 places, 335 transitions, 1045 flow [2022-11-21 16:17:20,328 INFO L271 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-21 16:17:20,329 INFO L288 CegarLoopForPetriNet]: 300 programPoint places, -15 predicate places. [2022-11-21 16:17:20,329 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 335 transitions, 1045 flow [2022-11-21 16:17:20,330 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-21 16:17:20,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:20,330 INFO L209 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-21 16:17:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:17:20,331 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-21 16:17:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 609152162, now seen corresponding path program 1 times [2022-11-21 16:17:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:20,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600379829] [2022-11-21 16:17:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:17:20,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:17:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:17:20,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:17:20,399 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:17:20,400 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (109 of 110 remaining) [2022-11-21 16:17:20,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (108 of 110 remaining) [2022-11-21 16:17:20,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (107 of 110 remaining) [2022-11-21 16:17:20,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (106 of 110 remaining) [2022-11-21 16:17:20,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (105 of 110 remaining) [2022-11-21 16:17:20,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (104 of 110 remaining) [2022-11-21 16:17:20,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (103 of 110 remaining) [2022-11-21 16:17:20,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (102 of 110 remaining) [2022-11-21 16:17:20,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (101 of 110 remaining) [2022-11-21 16:17:20,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (100 of 110 remaining) [2022-11-21 16:17:20,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (99 of 110 remaining) [2022-11-21 16:17:20,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (98 of 110 remaining) [2022-11-21 16:17:20,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (97 of 110 remaining) [2022-11-21 16:17:20,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (96 of 110 remaining) [2022-11-21 16:17:20,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (95 of 110 remaining) [2022-11-21 16:17:20,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (94 of 110 remaining) [2022-11-21 16:17:20,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (93 of 110 remaining) [2022-11-21 16:17:20,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (92 of 110 remaining) [2022-11-21 16:17:20,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (91 of 110 remaining) [2022-11-21 16:17:20,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (90 of 110 remaining) [2022-11-21 16:17:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (89 of 110 remaining) [2022-11-21 16:17:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (88 of 110 remaining) [2022-11-21 16:17:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (87 of 110 remaining) [2022-11-21 16:17:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (86 of 110 remaining) [2022-11-21 16:17:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (85 of 110 remaining) [2022-11-21 16:17:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (84 of 110 remaining) [2022-11-21 16:17:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (83 of 110 remaining) [2022-11-21 16:17:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (82 of 110 remaining) [2022-11-21 16:17:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (81 of 110 remaining) [2022-11-21 16:17:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (80 of 110 remaining) [2022-11-21 16:17:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (79 of 110 remaining) [2022-11-21 16:17:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (78 of 110 remaining) [2022-11-21 16:17:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (77 of 110 remaining) [2022-11-21 16:17:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (76 of 110 remaining) [2022-11-21 16:17:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (75 of 110 remaining) [2022-11-21 16:17:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (74 of 110 remaining) [2022-11-21 16:17:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (73 of 110 remaining) [2022-11-21 16:17:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (72 of 110 remaining) [2022-11-21 16:17:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (71 of 110 remaining) [2022-11-21 16:17:20,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (70 of 110 remaining) [2022-11-21 16:17:20,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (69 of 110 remaining) [2022-11-21 16:17:20,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (68 of 110 remaining) [2022-11-21 16:17:20,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (67 of 110 remaining) [2022-11-21 16:17:20,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (66 of 110 remaining) [2022-11-21 16:17:20,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (65 of 110 remaining) [2022-11-21 16:17:20,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (64 of 110 remaining) [2022-11-21 16:17:20,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (63 of 110 remaining) [2022-11-21 16:17:20,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (62 of 110 remaining) [2022-11-21 16:17:20,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (61 of 110 remaining) [2022-11-21 16:17:20,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (60 of 110 remaining) [2022-11-21 16:17:20,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (59 of 110 remaining) [2022-11-21 16:17:20,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (58 of 110 remaining) [2022-11-21 16:17:20,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (57 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 110 remaining) [2022-11-21 16:17:20,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (50 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (49 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (48 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (47 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (46 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (45 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (44 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (43 of 110 remaining) [2022-11-21 16:17:20,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (42 of 110 remaining) [2022-11-21 16:17:20,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (41 of 110 remaining) [2022-11-21 16:17:20,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (40 of 110 remaining) [2022-11-21 16:17:20,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (39 of 110 remaining) [2022-11-21 16:17:20,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (38 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (37 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (36 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (35 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (34 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (33 of 110 remaining) [2022-11-21 16:17:20,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (32 of 110 remaining) [2022-11-21 16:17:20,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (31 of 110 remaining) [2022-11-21 16:17:20,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (30 of 110 remaining) [2022-11-21 16:17:20,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (29 of 110 remaining) [2022-11-21 16:17:20,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (28 of 110 remaining) [2022-11-21 16:17:20,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (27 of 110 remaining) [2022-11-21 16:17:20,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (26 of 110 remaining) [2022-11-21 16:17:20,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (25 of 110 remaining) [2022-11-21 16:17:20,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (24 of 110 remaining) [2022-11-21 16:17:20,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (23 of 110 remaining) [2022-11-21 16:17:20,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (22 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (21 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (20 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (19 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (18 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (17 of 110 remaining) [2022-11-21 16:17:20,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (16 of 110 remaining) [2022-11-21 16:17:20,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (15 of 110 remaining) [2022-11-21 16:17:20,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (14 of 110 remaining) [2022-11-21 16:17:20,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (13 of 110 remaining) [2022-11-21 16:17:20,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (12 of 110 remaining) [2022-11-21 16:17:20,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (11 of 110 remaining) [2022-11-21 16:17:20,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (10 of 110 remaining) [2022-11-21 16:17:20,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (9 of 110 remaining) [2022-11-21 16:17:20,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (8 of 110 remaining) [2022-11-21 16:17:20,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (7 of 110 remaining) [2022-11-21 16:17:20,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (6 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (5 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (4 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (3 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (2 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (1 of 110 remaining) [2022-11-21 16:17:20,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (0 of 110 remaining) [2022-11-21 16:17:20,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:17:20,425 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:20,432 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:17:20,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:17:20,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:17:20 BasicIcfg [2022-11-21 16:17:20,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:17:20,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:17:20,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:17:20,516 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:17:20,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:16:53" (3/4) ... [2022-11-21 16:17:20,520 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:17:20,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:17:20,521 INFO L158 Benchmark]: Toolchain (without parser) took 29331.45ms. Allocated memory was 163.6MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 117.3MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-21 16:17:20,521 INFO L158 Benchmark]: CDTParser took 18.91ms. Allocated memory is still 130.0MB. Free memory was 70.1MB in the beginning and 94.6MB in the end (delta: -24.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-11-21 16:17:20,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.41ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 95.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:17:20,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.33ms. Allocated memory is still 163.6MB. Free memory was 95.2MB in the beginning and 91.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:17:20,522 INFO L158 Benchmark]: Boogie Preprocessor took 52.28ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 89.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:17:20,522 INFO L158 Benchmark]: RCFGBuilder took 1460.74ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 77.4MB in the end (delta: 11.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-21 16:17:20,523 INFO L158 Benchmark]: TraceAbstraction took 27045.83ms. Allocated memory was 163.6MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 76.6MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-21 16:17:20,523 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 9.2GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:17:20,525 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 18.91ms. Allocated memory is still 130.0MB. Free memory was 70.1MB in the beginning and 94.6MB in the end (delta: -24.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.41ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 95.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.33ms. Allocated memory is still 163.6MB. Free memory was 95.2MB in the beginning and 91.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.28ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 89.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1460.74ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 77.4MB in the end (delta: 11.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27045.83ms. Allocated memory was 163.6MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 76.6MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 9.2GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 2.6kB). 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) [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, readerprogress2=0, readerstart1=0, readerstart2=0] [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] [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: 26.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s 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 proved your program to be incorrect! [2022-11-21 16:17:20,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee4042a-e3e2-44be-97f5-3a6ca95b2ee8/bin/uautomizer-vX5HgA9Q3a/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