./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1980d3c26a5811df2d100379a9d31e1e9ec963bc59bfe660be33ada51bfb014 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 15:52:00,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 15:52:00,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 15:52:00,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 15:52:00,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 15:52:00,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 15:52:00,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 15:52:00,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 15:52:00,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 15:52:00,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 15:52:00,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 15:52:00,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 15:52:00,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 15:52:00,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 15:52:00,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 15:52:00,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 15:52:00,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 15:52:00,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 15:52:00,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 15:52:00,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 15:52:00,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 15:52:00,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 15:52:00,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 15:52:00,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 15:52:00,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 15:52:00,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 15:52:00,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 15:52:00,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 15:52:00,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 15:52:00,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 15:52:00,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 15:52:00,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 15:52:00,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 15:52:00,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 15:52:00,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 15:52:00,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 15:52:00,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 15:52:00,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 15:52:00,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 15:52:00,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 15:52:00,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 15:52:00,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 15:52:00,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 15:52:00,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 15:52:00,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 15:52:00,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 15:52:00,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 15:52:00,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 15:52:00,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 15:52:00,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 15:52:00,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 15:52:00,524 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 15:52:00,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 15:52:00,525 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 15:52:00,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 15:52:00,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 15:52:00,526 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 15:52:00,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 15:52:00,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:52:00,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 15:52:00,528 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 15:52:00,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 15:52:00,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-04-18 15:52:00,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 15:52:00,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 15:52:00,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 15:52:00,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 15:52:00,752 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 15:52:00,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i [2022-04-18 15:52:00,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a40f2109/f976525c2f6745feafce6102020ec552/FLAG2d16a787a [2022-04-18 15:52:01,242 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 15:52:01,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i [2022-04-18 15:52:01,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a40f2109/f976525c2f6745feafce6102020ec552/FLAG2d16a787a [2022-04-18 15:52:01,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a40f2109/f976525c2f6745feafce6102020ec552 [2022-04-18 15:52:01,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 15:52:01,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 15:52:01,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 15:52:01,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 15:52:01,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 15:52:01,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd52bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01, skipping insertion in model container [2022-04-18 15:52:01,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 15:52:01,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 15:52:01,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i[30690,30703] [2022-04-18 15:52:01,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i[30912,30925] [2022-04-18 15:52:01,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:52:01,722 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 15:52:01,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i[30690,30703] [2022-04-18 15:52:01,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-2.i[30912,30925] [2022-04-18 15:52:01,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:52:01,814 INFO L208 MainTranslator]: Completed translation [2022-04-18 15:52:01,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01 WrapperNode [2022-04-18 15:52:01,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 15:52:01,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 15:52:01,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 15:52:01,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 15:52:01,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,859 INFO L137 Inliner]: procedures = 177, calls = 44, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 441 [2022-04-18 15:52:01,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 15:52:01,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 15:52:01,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 15:52:01,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 15:52:01,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 15:52:01,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 15:52:01,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 15:52:01,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 15:52:01,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (1/1) ... [2022-04-18 15:52:01,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:52:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:52:01,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 15:52:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-04-18 15:52:01,994 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-04-18 15:52:01,994 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-04-18 15:52:01,994 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 15:52:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 15:52:01,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 15:52:01,996 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 15:52:02,114 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 15:52:02,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 15:52:02,525 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 15:52:02,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 15:52:02,780 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-18 15:52:02,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:02 BoogieIcfgContainer [2022-04-18 15:52:02,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 15:52:02,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 15:52:02,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 15:52:02,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 15:52:02,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:52:01" (1/3) ... [2022-04-18 15:52:02,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abb7899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:52:02, skipping insertion in model container [2022-04-18 15:52:02,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:52:01" (2/3) ... [2022-04-18 15:52:02,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abb7899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:52:02, skipping insertion in model container [2022-04-18 15:52:02,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:02" (3/3) ... [2022-04-18 15:52:02,788 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-2.i [2022-04-18 15:52:02,791 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 15:52:02,792 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 15:52:02,792 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-04-18 15:52:02,792 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 15:52:02,862 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 15:52:02,940 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:52:02,944 INFO L340 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 [2022-04-18 15:52:02,946 INFO L341 AbstractCegarLoop]: Starting to check reachability of 110 error locations. [2022-04-18 15:52:02,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 315 places, 323 transitions, 670 flow [2022-04-18 15:52:03,062 INFO L129 PetriNetUnfolder]: 18/320 cut-off events. [2022-04-18 15:52:03,062 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 15:52:03,073 INFO L84 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 907 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-04-18 15:52:03,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 323 transitions, 670 flow [2022-04-18 15:52:03,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 308 transitions, 631 flow [2022-04-18 15:52:03,095 INFO L129 PetriNetUnfolder]: 1/46 cut-off events. [2022-04-18 15:52:03,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:52:03,095 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:03,096 INFO L255 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-04-18 15:52:03,097 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 793044900, now seen corresponding path program 1 times [2022-04-18 15:52:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:03,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044108926] [2022-04-18 15:52:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044108926] [2022-04-18 15:52:03,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044108926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:03,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:03,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425201178] [2022-04-18 15:52:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:03,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:03,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:03,355 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-04-18 15:52:03,359 INFO L92 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-04-18 15:52:03,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:03,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-04-18 15:52:03,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:04,325 INFO L129 PetriNetUnfolder]: 1878/7749 cut-off events. [2022-04-18 15:52:04,326 INFO L130 PetriNetUnfolder]: For 439/439 co-relation queries the response was YES. [2022-04-18 15:52:04,351 INFO L84 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 78085 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-04-18 15:52:04,396 INFO L132 encePairwiseOnDemand]: 281/323 looper letters, 45 selfloop transitions, 8 changer transitions 0/299 dead transitions. [2022-04-18 15:52:04,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 299 transitions, 731 flow [2022-04-18 15:52:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2022-04-18 15:52:04,412 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9236326109391125 [2022-04-18 15:52:04,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2022-04-18 15:52:04,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2022-04-18 15:52:04,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:04,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2022-04-18 15:52:04,422 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-04-18 15:52:04,428 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-04-18 15:52:04,429 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-04-18 15:52:04,431 INFO L186 Difference]: Start difference. First operand has 300 places, 308 transitions, 631 flow. Second operand 3 states and 895 transitions. [2022-04-18 15:52:04,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 299 transitions, 731 flow [2022-04-18 15:52:04,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 299 transitions, 715 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 15:52:04,444 INFO L242 Difference]: Finished difference. Result has 273 places, 282 transitions, 618 flow [2022-04-18 15:52:04,445 INFO L318 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-04-18 15:52:04,448 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -27 predicate places. [2022-04-18 15:52:04,448 INFO L478 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 618 flow [2022-04-18 15:52:04,449 INFO L479 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-04-18 15:52:04,449 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:04,449 INFO L255 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-04-18 15:52:04,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 15:52:04,450 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1529989037, now seen corresponding path program 1 times [2022-04-18 15:52:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:04,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148891704] [2022-04-18 15:52:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:04,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:04,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148891704] [2022-04-18 15:52:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148891704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:04,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:04,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829233774] [2022-04-18 15:52:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:04,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:04,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:04,523 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-04-18 15:52:04,524 INFO L92 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-04-18 15:52:04,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:04,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-04-18 15:52:04,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:05,183 INFO L129 PetriNetUnfolder]: 1173/5814 cut-off events. [2022-04-18 15:52:05,184 INFO L130 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-04-18 15:52:05,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 5814 events. 1173/5814 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 58416 event pairs, 434 based on Foata normal form. 0/4753 useless extension candidates. Maximal degree in co-relation 3841. Up to 1198 conditions per place. [2022-04-18 15:52:05,243 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 28 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-04-18 15:52:05,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 292 transitions, 705 flow [2022-04-18 15:52:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-04-18 15:52:05,245 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-04-18 15:52:05,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-04-18 15:52:05,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-04-18 15:52:05,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:05,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-04-18 15:52:05,248 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-04-18 15:52:05,249 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-04-18 15:52:05,250 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-04-18 15:52:05,250 INFO L186 Difference]: Start difference. First operand has 273 places, 282 transitions, 618 flow. Second operand 3 states and 843 transitions. [2022-04-18 15:52:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 292 transitions, 705 flow [2022-04-18 15:52:05,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 292 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:05,260 INFO L242 Difference]: Finished difference. Result has 275 places, 285 transitions, 632 flow [2022-04-18 15:52:05,261 INFO L318 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-04-18 15:52:05,262 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -25 predicate places. [2022-04-18 15:52:05,263 INFO L478 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 632 flow [2022-04-18 15:52:05,264 INFO L479 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-04-18 15:52:05,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:05,264 INFO L255 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-04-18 15:52:05,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 15:52:05,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 66168034, now seen corresponding path program 1 times [2022-04-18 15:52:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:05,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131587946] [2022-04-18 15:52:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:05,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131587946] [2022-04-18 15:52:05,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131587946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:05,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:05,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524693996] [2022-04-18 15:52:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:05,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:05,327 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-04-18 15:52:05,328 INFO L92 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-04-18 15:52:05,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:05,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-04-18 15:52:05,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:06,038 INFO L129 PetriNetUnfolder]: 1298/6908 cut-off events. [2022-04-18 15:52:06,039 INFO L130 PetriNetUnfolder]: For 314/366 co-relation queries the response was YES. [2022-04-18 15:52:06,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 6908 events. 1298/6908 cut-off events. For 314/366 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 73101 event pairs, 448 based on Foata normal form. 4/5638 useless extension candidates. Maximal degree in co-relation 3273. Up to 1263 conditions per place. [2022-04-18 15:52:06,189 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-04-18 15:52:06,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 295 transitions, 725 flow [2022-04-18 15:52:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-04-18 15:52:06,193 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-04-18 15:52:06,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-04-18 15:52:06,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-04-18 15:52:06,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:06,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-04-18 15:52:06,195 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-04-18 15:52:06,197 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-04-18 15:52:06,198 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-04-18 15:52:06,198 INFO L186 Difference]: Start difference. First operand has 275 places, 285 transitions, 632 flow. Second operand 3 states and 843 transitions. [2022-04-18 15:52:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 295 transitions, 725 flow [2022-04-18 15:52:06,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 295 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:06,205 INFO L242 Difference]: Finished difference. Result has 277 places, 288 transitions, 656 flow [2022-04-18 15:52:06,205 INFO L318 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-04-18 15:52:06,207 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -23 predicate places. [2022-04-18 15:52:06,207 INFO L478 AbstractCegarLoop]: Abstraction has has 277 places, 288 transitions, 656 flow [2022-04-18 15:52:06,208 INFO L479 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-04-18 15:52:06,208 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:06,208 INFO L255 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-04-18 15:52:06,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 15:52:06,208 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1919312747, now seen corresponding path program 1 times [2022-04-18 15:52:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:06,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541622690] [2022-04-18 15:52:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541622690] [2022-04-18 15:52:06,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541622690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:06,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:06,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986899186] [2022-04-18 15:52:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:06,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:06,297 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-04-18 15:52:06,298 INFO L92 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-04-18 15:52:06,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:06,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-04-18 15:52:06,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:07,547 INFO L129 PetriNetUnfolder]: 1735/10798 cut-off events. [2022-04-18 15:52:07,547 INFO L130 PetriNetUnfolder]: For 581/614 co-relation queries the response was YES. [2022-04-18 15:52:07,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14200 conditions, 10798 events. 1735/10798 cut-off events. For 581/614 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 129351 event pairs, 668 based on Foata normal form. 0/8768 useless extension candidates. Maximal degree in co-relation 8584. Up to 1816 conditions per place. [2022-04-18 15:52:07,693 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 30 selfloop transitions, 6 changer transitions 0/300 dead transitions. [2022-04-18 15:52:07,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 300 transitions, 767 flow [2022-04-18 15:52:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-04-18 15:52:07,696 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-04-18 15:52:07,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-04-18 15:52:07,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-04-18 15:52:07,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:07,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-04-18 15:52:07,701 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-04-18 15:52:07,702 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-04-18 15:52:07,703 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-04-18 15:52:07,703 INFO L186 Difference]: Start difference. First operand has 277 places, 288 transitions, 656 flow. Second operand 3 states and 843 transitions. [2022-04-18 15:52:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 300 transitions, 767 flow [2022-04-18 15:52:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 300 transitions, 753 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:07,714 INFO L242 Difference]: Finished difference. Result has 279 places, 293 transitions, 700 flow [2022-04-18 15:52:07,714 INFO L318 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-04-18 15:52:07,715 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -21 predicate places. [2022-04-18 15:52:07,715 INFO L478 AbstractCegarLoop]: Abstraction has has 279 places, 293 transitions, 700 flow [2022-04-18 15:52:07,716 INFO L479 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-04-18 15:52:07,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:07,717 INFO L255 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-04-18 15:52:07,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 15:52:07,717 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1696456880, now seen corresponding path program 1 times [2022-04-18 15:52:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:07,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334798794] [2022-04-18 15:52:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:07,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:07,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334798794] [2022-04-18 15:52:07,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334798794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:07,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:07,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 15:52:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353482772] [2022-04-18 15:52:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:07,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 15:52:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 15:52:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 15:52:07,847 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 323 [2022-04-18 15:52:07,848 INFO L92 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-04-18 15:52:07,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:07,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 323 [2022-04-18 15:52:07,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:11,913 INFO L129 PetriNetUnfolder]: 8124/44330 cut-off events. [2022-04-18 15:52:11,914 INFO L130 PetriNetUnfolder]: For 3092/3127 co-relation queries the response was YES. [2022-04-18 15:52:12,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57793 conditions, 44330 events. 8124/44330 cut-off events. For 3092/3127 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 681007 event pairs, 1218 based on Foata normal form. 0/35448 useless extension candidates. Maximal degree in co-relation 29978. Up to 3082 conditions per place. [2022-04-18 15:52:12,360 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 92 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2022-04-18 15:52:12,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 348 transitions, 1138 flow [2022-04-18 15:52:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 15:52:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 15:52:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2022-04-18 15:52:12,364 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-04-18 15:52:12,364 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2022-04-18 15:52:12,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2022-04-18 15:52:12,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:12,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2022-04-18 15:52:12,367 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-04-18 15:52:12,370 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-04-18 15:52:12,371 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-04-18 15:52:12,371 INFO L186 Difference]: Start difference. First operand has 279 places, 293 transitions, 700 flow. Second operand 6 states and 1596 transitions. [2022-04-18 15:52:12,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 348 transitions, 1138 flow [2022-04-18 15:52:12,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 348 transitions, 1102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:12,383 INFO L242 Difference]: Finished difference. Result has 281 places, 292 transitions, 694 flow [2022-04-18 15:52:12,383 INFO L318 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-04-18 15:52:12,385 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-04-18 15:52:12,385 INFO L478 AbstractCegarLoop]: Abstraction has has 281 places, 292 transitions, 694 flow [2022-04-18 15:52:12,386 INFO L479 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-04-18 15:52:12,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:12,387 INFO L255 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-04-18 15:52:12,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 15:52:12,387 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1949272664, now seen corresponding path program 1 times [2022-04-18 15:52:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:12,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745399855] [2022-04-18 15:52:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:12,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745399855] [2022-04-18 15:52:12,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745399855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:12,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116018341] [2022-04-18 15:52:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:12,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:12,439 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 323 [2022-04-18 15:52:12,440 INFO L92 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-04-18 15:52:12,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:12,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 323 [2022-04-18 15:52:12,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:13,649 INFO L129 PetriNetUnfolder]: 1963/13432 cut-off events. [2022-04-18 15:52:13,650 INFO L130 PetriNetUnfolder]: For 1058/1218 co-relation queries the response was YES. [2022-04-18 15:52:13,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17490 conditions, 13432 events. 1963/13432 cut-off events. For 1058/1218 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 170233 event pairs, 662 based on Foata normal form. 7/10906 useless extension candidates. Maximal degree in co-relation 15660. Up to 1882 conditions per place. [2022-04-18 15:52:13,784 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 34 selfloop transitions, 6 changer transitions 0/304 dead transitions. [2022-04-18 15:52:13,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 304 transitions, 815 flow [2022-04-18 15:52:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2022-04-18 15:52:13,786 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8699690402476781 [2022-04-18 15:52:13,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2022-04-18 15:52:13,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2022-04-18 15:52:13,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:13,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2022-04-18 15:52:13,789 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-04-18 15:52:13,790 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-04-18 15:52:13,790 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-04-18 15:52:13,790 INFO L186 Difference]: Start difference. First operand has 281 places, 292 transitions, 694 flow. Second operand 3 states and 843 transitions. [2022-04-18 15:52:13,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 304 transitions, 815 flow [2022-04-18 15:52:13,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 304 transitions, 808 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 15:52:13,796 INFO L242 Difference]: Finished difference. Result has 281 places, 297 transitions, 747 flow [2022-04-18 15:52:13,796 INFO L318 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-04-18 15:52:13,796 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2022-04-18 15:52:13,797 INFO L478 AbstractCegarLoop]: Abstraction has has 281 places, 297 transitions, 747 flow [2022-04-18 15:52:13,797 INFO L479 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-04-18 15:52:13,797 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:13,797 INFO L255 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-04-18 15:52:13,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 15:52:13,798 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1269489537, now seen corresponding path program 1 times [2022-04-18 15:52:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169626985] [2022-04-18 15:52:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:13,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169626985] [2022-04-18 15:52:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169626985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:13,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:13,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:13,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466850187] [2022-04-18 15:52:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:13,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:13,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:13,829 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-04-18 15:52:13,830 INFO L92 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-04-18 15:52:13,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:13,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-04-18 15:52:13,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:16,363 INFO L129 PetriNetUnfolder]: 4773/25375 cut-off events. [2022-04-18 15:52:16,364 INFO L130 PetriNetUnfolder]: For 1727/1757 co-relation queries the response was YES. [2022-04-18 15:52:16,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37492 conditions, 25375 events. 4773/25375 cut-off events. For 1727/1757 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 357959 event pairs, 974 based on Foata normal form. 0/21779 useless extension candidates. Maximal degree in co-relation 22525. Up to 4748 conditions per place. [2022-04-18 15:52:16,652 INFO L132 encePairwiseOnDemand]: 296/323 looper letters, 53 selfloop transitions, 20 changer transitions 0/321 dead transitions. [2022-04-18 15:52:16,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 321 transitions, 943 flow [2022-04-18 15:52:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-04-18 15:52:16,659 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-04-18 15:52:16,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-04-18 15:52:16,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-04-18 15:52:16,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:16,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-04-18 15:52:16,667 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-04-18 15:52:16,688 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-04-18 15:52:16,689 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-04-18 15:52:16,689 INFO L186 Difference]: Start difference. First operand has 281 places, 297 transitions, 747 flow. Second operand 3 states and 825 transitions. [2022-04-18 15:52:16,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 321 transitions, 943 flow [2022-04-18 15:52:16,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 321 transitions, 925 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:16,719 INFO L242 Difference]: Finished difference. Result has 283 places, 315 transitions, 895 flow [2022-04-18 15:52:16,730 INFO L318 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-04-18 15:52:16,731 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -17 predicate places. [2022-04-18 15:52:16,731 INFO L478 AbstractCegarLoop]: Abstraction has has 283 places, 315 transitions, 895 flow [2022-04-18 15:52:16,734 INFO L479 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-04-18 15:52:16,734 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:16,734 INFO L255 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-04-18 15:52:16,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 15:52:16,734 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1269520322, now seen corresponding path program 1 times [2022-04-18 15:52:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:16,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728210439] [2022-04-18 15:52:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:52:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:52:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:52:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728210439] [2022-04-18 15:52:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728210439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:52:16,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:52:16,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:52:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753643698] [2022-04-18 15:52:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:52:16,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:52:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:52:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:52:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:52:16,806 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2022-04-18 15:52:16,807 INFO L92 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-04-18 15:52:16,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:52:16,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2022-04-18 15:52:16,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:52:19,049 INFO L382 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, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 108#L767-12true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,049 INFO L384 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,050 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,050 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,050 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,051 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 108#L767-12true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,051 INFO L384 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,051 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,051 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,052 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-04-18 15:52:19,127 INFO L382 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|), 134#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|), 199#L766-12true, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,127 INFO L384 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,127 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,128 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,128 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,146 INFO L382 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, 247#L739-3true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), 164#L767-13true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,147 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,147 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,147 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,147 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,164 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), 164#L767-13true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,164 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,164 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,164 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,164 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-04-18 15:52:19,383 INFO L382 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, 247#L739-3true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 11#L771-4true, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,383 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,383 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,383 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,383 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,384 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 11#L771-4true, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,384 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,384 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,384 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,385 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,387 INFO L382 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, 247#L739-3true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 228#L767-7true, 355#true]) [2022-04-18 15:52:19,388 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,388 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,388 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,388 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,389 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 228#L767-7true, 355#true]) [2022-04-18 15:52:19,389 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,389 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,389 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,389 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-04-18 15:52:19,500 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 305#L771-5true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,501 INFO L384 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,501 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,501 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,501 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,502 INFO L382 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, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 305#L771-5true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,502 INFO L384 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,502 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,502 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,502 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,505 INFO L382 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, 247#L739-3true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 65#L767-8true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,505 INFO L384 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,505 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,505 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,505 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,506 INFO L382 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][223], [Black: 351#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet24#1|), Black: 318#true, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 65#L767-8true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,506 INFO L384 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,506 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,506 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,506 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-04-18 15:52:19,581 INFO L382 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|), 134#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|), 11#L771-4true, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,581 INFO L384 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-04-18 15:52:19,581 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:19,581 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:19,582 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:19,582 INFO L382 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|), 134#L787-7true, 108#L767-12true, 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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,582 INFO L384 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-04-18 15:52:19,582 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-04-18 15:52:19,582 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-04-18 15:52:19,582 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-04-18 15:52:19,596 INFO L382 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|), 56#qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACEtrue, 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,596 INFO L384 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-04-18 15:52:19,596 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,597 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,597 INFO L387 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-04-18 15:52:19,835 INFO L382 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|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 177#qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,835 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,835 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-04-18 15:52:19,835 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-04-18 15:52:19,835 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-04-18 15:52:19,846 INFO L382 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, 247#L739-3true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 71#L771-9true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,847 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,847 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,847 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,847 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,847 INFO L382 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, 247#L739-3true, 361#true, 99#L786-4true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 71#L771-9true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:19,848 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,848 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,848 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:19,848 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-04-18 15:52:20,046 INFO L382 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, 99#L786-4true, 361#true, 193#L744-3true, 302#L777-2true, Black: 355#true, Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 66#L725-3true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 357#(= |#race~ctr2~0| 0), qrcu_updaterThread1of1ForFork0InUse]) [2022-04-18 15:52:20,046 INFO L384 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-04-18 15:52:20,046 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-04-18 15:52:20,047 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-04-18 15:52:20,047 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-04-18 15:52:20,069 INFO L382 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, 164#L767-13true, Black: 357#(= |#race~ctr2~0| 0), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 134#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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,070 INFO L384 tUnfolder$Statistics]: this new event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,070 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,070 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,070 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,145 INFO L382 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|), 134#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|), qrcu_updaterThread1of1ForFork0InUse, 228#L767-7true, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,146 INFO L384 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-04-18 15:52:20,146 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:20,146 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:20,146 INFO L387 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-04-18 15:52:20,296 INFO L382 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|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 305#L771-5true, Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,296 INFO L384 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,297 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,297 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,297 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,298 INFO L382 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|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 65#L767-8true, 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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,298 INFO L384 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,298 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,298 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,298 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,367 INFO L382 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|), 131#qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACEtrue, 134#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|), 196#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-04-18 15:52:20,367 INFO L384 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,367 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,367 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,367 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 15:52:20,527 INFO L382 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|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 231#qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACEtrue, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,528 INFO L384 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-04-18 15:52:20,528 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,528 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,528 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 15:52:20,564 INFO L382 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|), 134#L787-7true, 71#L771-9true, 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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,565 INFO L384 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-04-18 15:52:20,565 INFO L387 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-04-18 15:52:20,565 INFO L387 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-04-18 15:52:20,565 INFO L387 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-04-18 15:52:20,702 INFO L382 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), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 241#L772-15true, 196#L758-3true, qrcu_updaterThread1of1ForFork0InUse, 355#true]) [2022-04-18 15:52:20,702 INFO L384 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,702 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,702 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,702 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,824 INFO L382 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), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 158#L772-16true, 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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,824 INFO L384 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L382 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), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 134#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|), 241#L772-15true, qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,825 INFO L384 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,826 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,826 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 15:52:20,847 INFO L382 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), Black: 326#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet19#1| |#race~readerprogress1~0|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), 158#L772-16true, 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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:20,847 INFO L384 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,848 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,848 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,848 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:20,848 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:21,262 INFO L382 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|), 134#L787-7true, 125#qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACEtrue, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:21,262 INFO L384 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-04-18 15:52:21,262 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:21,262 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:21,263 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 15:52:21,310 INFO L382 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|), 134#L787-7true, 36#L774-1true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:21,311 INFO L384 tUnfolder$Statistics]: this new event has 150 ancestors and is not cut-off event [2022-04-18 15:52:21,311 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-04-18 15:52:21,311 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-04-18 15:52:21,311 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-04-18 15:52:21,316 INFO L382 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], [72#L774-2true, 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|), 134#L787-7true, Black: 332#(= |qrcu_reader1Thread1of1ForFork1_#t~nondet20#1| |#race~readerprogress1~0|), Black: 338#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet23#1|), 347#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:21,316 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is not cut-off event [2022-04-18 15:52:21,316 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-04-18 15:52:21,316 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-04-18 15:52:21,316 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-04-18 15:52:21,323 INFO L382 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|), 47#qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACEtrue, 134#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|), qrcu_updaterThread1of1ForFork0InUse, 196#L758-3true, 355#true]) [2022-04-18 15:52:21,323 INFO L384 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-04-18 15:52:21,324 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 15:52:21,324 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 15:52:21,324 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 15:52:21,335 INFO L129 PetriNetUnfolder]: 7969/39237 cut-off events. [2022-04-18 15:52:21,336 INFO L130 PetriNetUnfolder]: For 10538/11262 co-relation queries the response was YES. [2022-04-18 15:52:21,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68272 conditions, 39237 events. 7969/39237 cut-off events. For 10538/11262 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 583627 event pairs, 1408 based on Foata normal form. 82/34944 useless extension candidates. Maximal degree in co-relation 23906. Up to 7864 conditions per place. [2022-04-18 15:52:21,632 INFO L132 encePairwiseOnDemand]: 296/323 looper letters, 59 selfloop transitions, 22 changer transitions 0/343 dead transitions. [2022-04-18 15:52:21,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 343 transitions, 1139 flow [2022-04-18 15:52:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:52:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:52:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-04-18 15:52:21,635 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8513931888544891 [2022-04-18 15:52:21,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2022-04-18 15:52:21,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2022-04-18 15:52:21,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:52:21,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2022-04-18 15:52:21,637 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-04-18 15:52:21,638 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-04-18 15:52:21,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-04-18 15:52:21,638 INFO L186 Difference]: Start difference. First operand has 283 places, 315 transitions, 895 flow. Second operand 3 states and 825 transitions. [2022-04-18 15:52:21,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 343 transitions, 1139 flow [2022-04-18 15:52:21,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 343 transitions, 1091 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:52:21,667 INFO L242 Difference]: Finished difference. Result has 285 places, 335 transitions, 1045 flow [2022-04-18 15:52:21,668 INFO L318 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-04-18 15:52:21,668 INFO L335 CegarLoopForPetriNet]: 300 programPoint places, -15 predicate places. [2022-04-18 15:52:21,668 INFO L478 AbstractCegarLoop]: Abstraction has has 285 places, 335 transitions, 1045 flow [2022-04-18 15:52:21,669 INFO L479 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-04-18 15:52:21,669 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:52:21,669 INFO L255 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-04-18 15:52:21,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 15:52:21,669 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (and 107 more)] === [2022-04-18 15:52:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:52:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1927403502, now seen corresponding path program 1 times [2022-04-18 15:52:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:52:21,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844543406] [2022-04-18 15:52:21,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:52:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:52:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:21,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:52:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:52:21,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:52:21,712 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:52:21,713 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (109 of 110 remaining) [2022-04-18 15:52:21,714 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (108 of 110 remaining) [2022-04-18 15:52:21,714 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (107 of 110 remaining) [2022-04-18 15:52:21,714 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (106 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (105 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (104 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (103 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (102 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (101 of 110 remaining) [2022-04-18 15:52:21,715 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (100 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (99 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (98 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (97 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (96 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (95 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (94 of 110 remaining) [2022-04-18 15:52:21,716 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (93 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (92 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (91 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (90 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (89 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (88 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (87 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (86 of 110 remaining) [2022-04-18 15:52:21,717 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (85 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (84 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (83 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (82 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (81 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (80 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (79 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (78 of 110 remaining) [2022-04-18 15:52:21,718 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (77 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (76 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (75 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (74 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (73 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (72 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (71 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (70 of 110 remaining) [2022-04-18 15:52:21,719 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (69 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (68 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (67 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (66 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (65 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (64 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (63 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (62 of 110 remaining) [2022-04-18 15:52:21,720 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (61 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (60 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (59 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (58 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (57 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 110 remaining) [2022-04-18 15:52:21,721 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (50 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (49 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (48 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (47 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (46 of 110 remaining) [2022-04-18 15:52:21,722 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (45 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (44 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (43 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (42 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (41 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (40 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (39 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (38 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (37 of 110 remaining) [2022-04-18 15:52:21,723 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (36 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (35 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (34 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (33 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (32 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (31 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (30 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (29 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (28 of 110 remaining) [2022-04-18 15:52:21,724 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (27 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (26 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (25 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (24 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (23 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (22 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (21 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (20 of 110 remaining) [2022-04-18 15:52:21,725 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (19 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (18 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (17 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (16 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (15 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (14 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (13 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (12 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (11 of 110 remaining) [2022-04-18 15:52:21,726 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (10 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (9 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (8 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (7 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (6 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (5 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (4 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (3 of 110 remaining) [2022-04-18 15:52:21,727 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (2 of 110 remaining) [2022-04-18 15:52:21,728 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (1 of 110 remaining) [2022-04-18 15:52:21,728 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (0 of 110 remaining) [2022-04-18 15:52:21,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 15:52:21,731 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:52:21,735 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 15:52:21,735 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 15:52:21,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:52:21 BasicIcfg [2022-04-18 15:52:21,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 15:52:21,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 15:52:21,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 15:52:21,791 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 15:52:21,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:52:02" (3/4) ... [2022-04-18 15:52:21,794 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 15:52:21,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 15:52:21,795 INFO L158 Benchmark]: Toolchain (without parser) took 20498.98ms. Allocated memory was 115.3MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 75.6MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 949.1MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,795 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:52:21,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.70ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 77.7MB in the end (delta: -2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.78ms. Allocated memory is still 115.3MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,796 INFO L158 Benchmark]: Boogie Preprocessor took 50.68ms. Allocated memory is still 115.3MB. Free memory was 74.3MB in the beginning and 71.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,796 INFO L158 Benchmark]: RCFGBuilder took 867.22ms. Allocated memory is still 115.3MB. Free memory was 71.6MB in the beginning and 57.4MB in the end (delta: 14.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,797 INFO L158 Benchmark]: TraceAbstraction took 19006.80ms. Allocated memory was 115.3MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 56.8MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 930.0MB. Max. memory is 16.1GB. [2022-04-18 15:52:21,797 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 6.0GB. Free memory is still 5.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:52:21,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.70ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 77.7MB in the end (delta: -2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.78ms. Allocated memory is still 115.3MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.68ms. Allocated memory is still 115.3MB. Free memory was 74.3MB in the beginning and 71.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 867.22ms. Allocated memory is still 115.3MB. Free memory was 71.6MB in the beginning and 57.4MB in the end (delta: 14.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19006.80ms. Allocated memory was 115.3MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 56.8MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 930.0MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 6.0GB. Free memory is still 5.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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}] [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] [L762] 3 int i; VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0] [L763] 3 int readerstart1=__VERIFIER_nondet_int(), readerstart2=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0] [L763] 3 int readerstart1=__VERIFIER_nondet_int(), readerstart2=__VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0, readerstart2=0] [L764] 3 int sum; VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1=0, readerstart2=0] [L765] CALL 3 __VERIFIER_atomic_take_snapshot(readerstart1, readerstart2) [L706] 3 readerstart1 = readerprogress1 [L707] 3 readerstart2 = readerprogress2 [L765] RET 3 __VERIFIER_atomic_take_snapshot(readerstart1, readerstart2) [L737] 1 readerprogress1 = 1 VAL [arg={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=1, readerprogress1 = 1=49, readerprogress2=0] Now there is a data race on ~readerprogress1~0 between C: readerstart1 = readerprogress1 [706] and C: readerprogress1 = 1 [737] - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 531 locations, 110 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 90 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-18 15:52:21,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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