./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:26:56,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:26:56,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:26:56,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:26:56,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:26:56,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:26:56,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:26:56,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:26:56,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:26:56,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:26:56,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:26:56,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:26:56,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:26:56,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:26:56,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:26:56,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:26:56,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:26:56,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:26:56,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:26:56,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:26:56,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:26:56,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:26:56,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:26:56,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:26:56,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:26:56,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:26:56,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:26:56,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:26:56,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:26:56,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:26:56,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:26:56,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:26:56,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:26:56,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:26:56,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:26:56,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:26:56,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:26:56,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:26:56,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:26:56,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:26:56,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:26:56,438 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:26:56,460 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:26:56,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:26:56,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:26:56,460 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:26:56,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:26:56,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:26:56,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:26:56,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:26:56,462 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:26:56,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:26:56,462 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:26:56,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:26:56,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:26:56,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:26:56,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:26:56,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:26:56,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:26:56,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2021-12-07 00:26:56,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:26:56,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:26:56,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:26:56,669 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:26:56,670 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:26:56,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-07 00:26:56,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/data/c2d700817/c6836aabef5747d8bff52b3658dff1b7/FLAG52ee02f4d [2021-12-07 00:26:57,129 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:26:57,130 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-07 00:26:57,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/data/c2d700817/c6836aabef5747d8bff52b3658dff1b7/FLAG52ee02f4d [2021-12-07 00:26:57,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/data/c2d700817/c6836aabef5747d8bff52b3658dff1b7 [2021-12-07 00:26:57,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:26:57,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:26:57,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:57,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:26:57,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:26:57,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64377908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57, skipping insertion in model container [2021-12-07 00:26:57,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:26:57,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:26:57,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-07 00:26:57,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-07 00:26:57,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:57,465 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:26:57,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-07 00:26:57,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-07 00:26:57,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:57,542 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:26:57,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57 WrapperNode [2021-12-07 00:26:57,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:57,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:26:57,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:26:57,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:26:57,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,593 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2021-12-07 00:26:57,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:26:57,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:26:57,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:26:57,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:26:57,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:26:57,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:26:57,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:26:57,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:26:57,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (1/1) ... [2021-12-07 00:26:57,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:26:57,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:26:57,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:26:57,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-12-07 00:26:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-12-07 00:26:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-12-07 00:26:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-07 00:26:57,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:26:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:26:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:26:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:26:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:26:57,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:26:57,694 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-07 00:26:57,775 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:26:57,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:26:58,015 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:26:58,106 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:26:58,106 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-07 00:26:58,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:58 BoogieIcfgContainer [2021-12-07 00:26:58,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:26:58,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:26:58,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:26:58,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:26:58,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:26:57" (1/3) ... [2021-12-07 00:26:58,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319f47df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:58, skipping insertion in model container [2021-12-07 00:26:58,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:57" (2/3) ... [2021-12-07 00:26:58,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319f47df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:58, skipping insertion in model container [2021-12-07 00:26:58,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:58" (3/3) ... [2021-12-07 00:26:58,114 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-12-07 00:26:58,118 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-07 00:26:58,118 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:26:58,119 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 00:26:58,119 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-07 00:26:58,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,160 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,176 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,177 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,188 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:26:58,197 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-07 00:26:58,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:26:58,237 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:26:58,237 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-07 00:26:58,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2021-12-07 00:26:58,303 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2021-12-07 00:26:58,303 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-07 00:26:58,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 18/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 134. Up to 4 conditions per place. [2021-12-07 00:26:58,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2021-12-07 00:26:58,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2021-12-07 00:26:58,341 INFO L129 PetriNetUnfolder]: 9/124 cut-off events. [2021-12-07 00:26:58,342 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-07 00:26:58,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:26:58,342 INFO L254 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] [2021-12-07 00:26:58,343 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:26:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:26:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2021-12-07 00:26:58,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:26:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364198735] [2021-12-07 00:26:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:26:58,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:26:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:26:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:26:58,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:26:58,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364198735] [2021-12-07 00:26:58,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364198735] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:26:58,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:26:58,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:26:58,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521602354] [2021-12-07 00:26:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:26:58,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:26:58,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:26:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:26:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:26:58,579 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-12-07 00:26:58,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2021-12-07 00:26:58,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:26:58,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-12-07 00:26:58,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:26:58,877 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2021-12-07 00:26:58,877 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2021-12-07 00:26:58,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1791 events. 629/1791 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12222 event pairs, 272 based on Foata normal form. 180/1804 useless extension candidates. Maximal degree in co-relation 1910. Up to 618 conditions per place. [2021-12-07 00:26:58,895 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2021-12-07 00:26:58,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2021-12-07 00:26:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:26:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:26:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-07 00:26:58,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-07 00:26:58,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-07 00:26:58,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-07 00:26:58,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:26:58,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-07 00:26:58,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2021-12-07 00:26:58,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:26:58,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:26:58,921 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2021-12-07 00:26:58,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2021-12-07 00:26:58,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-07 00:26:58,929 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2021-12-07 00:26:58,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=159, PETRI_TRANSITIONS=163} [2021-12-07 00:26:58,934 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2021-12-07 00:26:58,934 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2021-12-07 00:26:58,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2021-12-07 00:26:58,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:26:58,934 INFO L254 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] [2021-12-07 00:26:58,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:26:58,935 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:26:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:26:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2021-12-07 00:26:58,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:26:58,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461622520] [2021-12-07 00:26:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:26:58,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:26:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:26:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:26:59,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:26:59,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461622520] [2021-12-07 00:26:59,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461622520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:26:59,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:26:59,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:26:59,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113084201] [2021-12-07 00:26:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:26:59,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:26:59,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:26:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:26:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:26:59,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-07 00:26:59,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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) [2021-12-07 00:26:59,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:26:59,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-07 00:26:59,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:26:59,228 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2021-12-07 00:26:59,228 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-12-07 00:26:59,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 1255 events. 402/1255 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7965 event pairs, 79 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1163. Up to 395 conditions per place. [2021-12-07 00:26:59,239 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-12-07 00:26:59,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2021-12-07 00:26:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:26:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:26:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-07 00:26:59,242 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-07 00:26:59,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-07 00:26:59,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-07 00:26:59,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:26:59,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-07 00:26:59,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2021-12-07 00:26:59,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:26:59,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:26:59,246 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2021-12-07 00:26:59,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2021-12-07 00:26:59,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-07 00:26:59,251 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2021-12-07 00:26:59,251 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2021-12-07 00:26:59,252 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2021-12-07 00:26:59,252 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2021-12-07 00:26:59,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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) [2021-12-07 00:26:59,252 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:26:59,253 INFO L254 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] [2021-12-07 00:26:59,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:26:59,253 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:26:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:26:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2021-12-07 00:26:59,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:26:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423141583] [2021-12-07 00:26:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:26:59,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:26:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:26:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:26:59,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:26:59,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423141583] [2021-12-07 00:26:59,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423141583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:26:59,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:26:59,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:26:59,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661513923] [2021-12-07 00:26:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:26:59,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:26:59,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:26:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:26:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:26:59,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:26:59,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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) [2021-12-07 00:26:59,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:26:59,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:26:59,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:00,097 INFO L129 PetriNetUnfolder]: 2951/6671 cut-off events. [2021-12-07 00:27:00,097 INFO L130 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2021-12-07 00:27:00,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10975 conditions, 6671 events. 2951/6671 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 56312 event pairs, 405 based on Foata normal form. 0/6223 useless extension candidates. Maximal degree in co-relation 7824. Up to 1682 conditions per place. [2021-12-07 00:27:00,144 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 84 selfloop transitions, 11 changer transitions 7/227 dead transitions. [2021-12-07 00:27:00,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 695 flow [2021-12-07 00:27:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:27:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-07 00:27:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1070 transitions. [2021-12-07 00:27:00,148 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352849336455894 [2021-12-07 00:27:00,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1070 transitions. [2021-12-07 00:27:00,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1070 transitions. [2021-12-07 00:27:00,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:00,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1070 transitions. [2021-12-07 00:27:00,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.85714285714286) internal successors, (1070), 7 states have internal predecessors, (1070), 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) [2021-12-07 00:27:00,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2021-12-07 00:27:00,158 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2021-12-07 00:27:00,158 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 7 states and 1070 transitions. [2021-12-07 00:27:00,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 695 flow [2021-12-07 00:27:00,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:27:00,168 INFO L242 Difference]: Finished difference. Result has 168 places, 172 transitions, 408 flow [2021-12-07 00:27:00,168 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=168, PETRI_TRANSITIONS=172} [2021-12-07 00:27:00,169 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2021-12-07 00:27:00,169 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 172 transitions, 408 flow [2021-12-07 00:27:00,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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) [2021-12-07 00:27:00,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:00,170 INFO L254 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, 1, 1, 1, 1, 1] [2021-12-07 00:27:00,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:27:00,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 54936445, now seen corresponding path program 1 times [2021-12-07 00:27:00,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582130999] [2021-12-07 00:27:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:00,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:00,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582130999] [2021-12-07 00:27:00,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582130999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:00,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:00,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:27:00,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020487509] [2021-12-07 00:27:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:00,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:27:00,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:27:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:27:00,276 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-07 00:27:00,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 172 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 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) [2021-12-07 00:27:00,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:00,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-07 00:27:00,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:00,740 INFO L129 PetriNetUnfolder]: 1220/3032 cut-off events. [2021-12-07 00:27:00,740 INFO L130 PetriNetUnfolder]: For 386/397 co-relation queries the response was YES. [2021-12-07 00:27:00,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 3032 events. 1220/3032 cut-off events. For 386/397 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 24014 event pairs, 241 based on Foata normal form. 128/3023 useless extension candidates. Maximal degree in co-relation 5210. Up to 1544 conditions per place. [2021-12-07 00:27:00,764 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 95 selfloop transitions, 31 changer transitions 0/253 dead transitions. [2021-12-07 00:27:00,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 253 transitions, 868 flow [2021-12-07 00:27:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 00:27:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-07 00:27:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2021-12-07 00:27:00,768 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2021-12-07 00:27:00,769 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2021-12-07 00:27:00,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2021-12-07 00:27:00,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:00,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2021-12-07 00:27:00,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.75) internal successors, (1198), 8 states have internal predecessors, (1198), 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) [2021-12-07 00:27:00,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2021-12-07 00:27:00,777 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2021-12-07 00:27:00,777 INFO L186 Difference]: Start difference. First operand has 168 places, 172 transitions, 408 flow. Second operand 8 states and 1198 transitions. [2021-12-07 00:27:00,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 253 transitions, 868 flow [2021-12-07 00:27:00,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 253 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-07 00:27:00,784 INFO L242 Difference]: Finished difference. Result has 181 places, 205 transitions, 655 flow [2021-12-07 00:27:00,784 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=655, PETRI_PLACES=181, PETRI_TRANSITIONS=205} [2021-12-07 00:27:00,785 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 21 predicate places. [2021-12-07 00:27:00,785 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 205 transitions, 655 flow [2021-12-07 00:27:00,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 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) [2021-12-07 00:27:00,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:00,786 INFO L254 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, 1, 1, 1, 1, 1] [2021-12-07 00:27:00,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:27:00,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1048679875, now seen corresponding path program 2 times [2021-12-07 00:27:00,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:00,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653561519] [2021-12-07 00:27:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:00,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:00,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653561519] [2021-12-07 00:27:00,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653561519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:00,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:00,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:27:00,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800339330] [2021-12-07 00:27:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:00,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:27:00,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:27:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:27:00,879 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2021-12-07 00:27:00,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 205 transitions, 655 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2021-12-07 00:27:00,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:00,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2021-12-07 00:27:00,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:01,633 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 101#L786-4true, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:01,633 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2021-12-07 00:27:01,633 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-07 00:27:01,633 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-07 00:27:01,633 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-07 00:27:01,685 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [111#L739-3true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 101#L786-4true, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:01,685 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2021-12-07 00:27:01,685 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-07 00:27:01,686 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-07 00:27:01,686 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-07 00:27:01,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:01,771 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-07 00:27:01,772 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:01,772 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:01,772 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:01,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [111#L739-3true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:01,817 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,817 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,818 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,818 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,828 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 119#L738true, 101#L786-4true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true]) [2021-12-07 00:27:01,828 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-07 00:27:01,828 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,828 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-07 00:27:01,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 101#L786-4true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true]) [2021-12-07 00:27:01,874 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2021-12-07 00:27:01,874 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-07 00:27:01,874 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:01,874 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2021-12-07 00:27:01,956 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:01,956 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,956 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,957 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,957 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,962 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 119#L738true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true]) [2021-12-07 00:27:01,963 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,963 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2021-12-07 00:27:01,963 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:01,963 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-07 00:27:01,999 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true]) [2021-12-07 00:27:01,999 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-07 00:27:01,999 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:01,999 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-07 00:27:01,999 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-07 00:27:02,032 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 55#L758-3true]) [2021-12-07 00:27:02,033 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is not cut-off event [2021-12-07 00:27:02,033 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-07 00:27:02,033 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-07 00:27:02,033 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-07 00:27:02,122 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 87#L788-2true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true]) [2021-12-07 00:27:02,122 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-12-07 00:27:02,122 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:02,122 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:02,122 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:02,171 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 71#L789-1true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true]) [2021-12-07 00:27:02,171 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is not cut-off event [2021-12-07 00:27:02,171 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-07 00:27:02,171 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-07 00:27:02,171 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-07 00:27:02,316 INFO L129 PetriNetUnfolder]: 5661/11999 cut-off events. [2021-12-07 00:27:02,316 INFO L130 PetriNetUnfolder]: For 11590/11778 co-relation queries the response was YES. [2021-12-07 00:27:02,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28466 conditions, 11999 events. 5661/11999 cut-off events. For 11590/11778 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 111859 event pairs, 1142 based on Foata normal form. 142/11468 useless extension candidates. Maximal degree in co-relation 25739. Up to 3359 conditions per place. [2021-12-07 00:27:02,397 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 175 selfloop transitions, 18 changer transitions 10/335 dead transitions. [2021-12-07 00:27:02,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 335 transitions, 1649 flow [2021-12-07 00:27:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:27:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:27:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2021-12-07 00:27:02,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2021-12-07 00:27:02,401 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2021-12-07 00:27:02,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2021-12-07 00:27:02,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:02,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2021-12-07 00:27:02,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.1) internal successors, (1381), 10 states have internal predecessors, (1381), 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) [2021-12-07 00:27:02,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:02,409 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:02,409 INFO L186 Difference]: Start difference. First operand has 181 places, 205 transitions, 655 flow. Second operand 10 states and 1381 transitions. [2021-12-07 00:27:02,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 335 transitions, 1649 flow [2021-12-07 00:27:02,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 335 transitions, 1649 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-07 00:27:02,452 INFO L242 Difference]: Finished difference. Result has 195 places, 221 transitions, 771 flow [2021-12-07 00:27:02,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=771, PETRI_PLACES=195, PETRI_TRANSITIONS=221} [2021-12-07 00:27:02,453 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 35 predicate places. [2021-12-07 00:27:02,453 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 221 transitions, 771 flow [2021-12-07 00:27:02,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2021-12-07 00:27:02,454 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:02,454 INFO L254 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, 1, 1, 1, 1, 1] [2021-12-07 00:27:02,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:27:02,454 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 181404697, now seen corresponding path program 1 times [2021-12-07 00:27:02,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:02,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453044717] [2021-12-07 00:27:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:02,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:02,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:02,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453044717] [2021-12-07 00:27:02,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453044717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:02,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:02,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:27:02,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978214129] [2021-12-07 00:27:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:02,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:27:02,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:27:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:27:02,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-07 00:27:02,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 221 transitions, 771 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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) [2021-12-07 00:27:02,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:02,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-07 00:27:02,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:03,262 INFO L129 PetriNetUnfolder]: 2049/5079 cut-off events. [2021-12-07 00:27:03,262 INFO L130 PetriNetUnfolder]: For 5457/5521 co-relation queries the response was YES. [2021-12-07 00:27:03,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 5079 events. 2049/5079 cut-off events. For 5457/5521 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 45552 event pairs, 226 based on Foata normal form. 97/4971 useless extension candidates. Maximal degree in co-relation 12429. Up to 1713 conditions per place. [2021-12-07 00:27:03,305 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 120 selfloop transitions, 37 changer transitions 0/298 dead transitions. [2021-12-07 00:27:03,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 298 transitions, 1417 flow [2021-12-07 00:27:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:27:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:27:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1468 transitions. [2021-12-07 00:27:03,310 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8021857923497268 [2021-12-07 00:27:03,310 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1468 transitions. [2021-12-07 00:27:03,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1468 transitions. [2021-12-07 00:27:03,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:03,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1468 transitions. [2021-12-07 00:27:03,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.8) internal successors, (1468), 10 states have internal predecessors, (1468), 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) [2021-12-07 00:27:03,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:03,319 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:03,319 INFO L186 Difference]: Start difference. First operand has 195 places, 221 transitions, 771 flow. Second operand 10 states and 1468 transitions. [2021-12-07 00:27:03,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 298 transitions, 1417 flow [2021-12-07 00:27:03,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 298 transitions, 1417 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-07 00:27:03,338 INFO L242 Difference]: Finished difference. Result has 209 places, 237 transitions, 1010 flow [2021-12-07 00:27:03,338 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1010, PETRI_PLACES=209, PETRI_TRANSITIONS=237} [2021-12-07 00:27:03,339 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2021-12-07 00:27:03,339 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 237 transitions, 1010 flow [2021-12-07 00:27:03,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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) [2021-12-07 00:27:03,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:03,340 INFO L254 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:03,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:27:03,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 928253015, now seen corresponding path program 1 times [2021-12-07 00:27:03,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:03,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881436017] [2021-12-07 00:27:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:03,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:03,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881436017] [2021-12-07 00:27:03,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881436017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:03,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:03,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:27:03,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254423911] [2021-12-07 00:27:03,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:03,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:27:03,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:27:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:27:03,410 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2021-12-07 00:27:03,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 237 transitions, 1010 flow. Second operand has 7 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 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) [2021-12-07 00:27:03,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:03,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2021-12-07 00:27:03,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:04,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][252], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,547 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][253], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,548 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,548 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:04,584 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:04,584 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,584 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,584 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,584 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,594 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 22#L739true, Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 267#(= ~readerprogress1~0 2), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:04,594 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,594 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,594 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,594 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,594 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:04,741 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 84#L787-1true, 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 52#L744-3true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:04,741 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,741 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:04,741 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,741 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,752 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 84#L787-1true, Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:04,752 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,752 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:04,752 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,752 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,752 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,792 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 22#L739true, Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,792 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,792 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,792 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,792 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:04,936 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][252], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 166#L771-3true, 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,936 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][253], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,937 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:04,937 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:04,972 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][254], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:04,972 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,972 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:04,972 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:04,972 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:05,283 INFO L129 PetriNetUnfolder]: 6794/15073 cut-off events. [2021-12-07 00:27:05,283 INFO L130 PetriNetUnfolder]: For 20200/20663 co-relation queries the response was YES. [2021-12-07 00:27:05,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39447 conditions, 15073 events. 6794/15073 cut-off events. For 20200/20663 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 151868 event pairs, 1749 based on Foata normal form. 280/14565 useless extension candidates. Maximal degree in co-relation 37597. Up to 4764 conditions per place. [2021-12-07 00:27:05,393 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 194 selfloop transitions, 9 changer transitions 11/356 dead transitions. [2021-12-07 00:27:05,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 356 transitions, 2030 flow [2021-12-07 00:27:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 00:27:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-07 00:27:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1126 transitions. [2021-12-07 00:27:05,396 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7691256830601093 [2021-12-07 00:27:05,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1126 transitions. [2021-12-07 00:27:05,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1126 transitions. [2021-12-07 00:27:05,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:05,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1126 transitions. [2021-12-07 00:27:05,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:05,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2021-12-07 00:27:05,402 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2021-12-07 00:27:05,402 INFO L186 Difference]: Start difference. First operand has 209 places, 237 transitions, 1010 flow. Second operand 8 states and 1126 transitions. [2021-12-07 00:27:05,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 356 transitions, 2030 flow [2021-12-07 00:27:05,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 356 transitions, 2007 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-07 00:27:05,535 INFO L242 Difference]: Finished difference. Result has 218 places, 245 transitions, 1081 flow [2021-12-07 00:27:05,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1081, PETRI_PLACES=218, PETRI_TRANSITIONS=245} [2021-12-07 00:27:05,536 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 58 predicate places. [2021-12-07 00:27:05,536 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 245 transitions, 1081 flow [2021-12-07 00:27:05,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 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) [2021-12-07 00:27:05,537 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:05,537 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:05,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:27:05,537 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash -810213288, now seen corresponding path program 1 times [2021-12-07 00:27:05,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:05,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30602595] [2021-12-07 00:27:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:05,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:05,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30602595] [2021-12-07 00:27:05,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30602595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:05,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:05,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:05,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359140950] [2021-12-07 00:27:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:05,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:27:05,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:27:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:05,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:05,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 245 transitions, 1081 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 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) [2021-12-07 00:27:05,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:05,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:05,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:07,018 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,019 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,019 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,019 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,020 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-07 00:27:07,105 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][237], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, 233#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 265#true, 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), 68#L725-3true, Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true]) [2021-12-07 00:27:07,105 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-07 00:27:07,105 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,105 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,105 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:07,177 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 119#L738true, 265#true, 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,177 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,177 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,177 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,177 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-07 00:27:07,230 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 287#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,231 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-07 00:27:07,231 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-07 00:27:07,231 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-07 00:27:07,231 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-07 00:27:07,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,233 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,233 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,233 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,234 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,234 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,234 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,234 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,234 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,234 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-07 00:27:07,304 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 287#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,304 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,304 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:07,304 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:07,304 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-07 00:27:07,311 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 168#L772-6true, Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,311 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-07 00:27:07,311 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:07,311 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:07,311 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-07 00:27:07,312 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 101#L786-4true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,313 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,313 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,313 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,313 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][237], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, 233#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 265#true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), 68#L725-3true, Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true]) [2021-12-07 00:27:07,319 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,372 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,372 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,372 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,372 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,372 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,373 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 287#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,373 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,373 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,373 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,373 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,376 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 120#L788-1true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,376 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,376 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,376 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,376 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,377 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 120#L788-1true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,377 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,377 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,377 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,377 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-07 00:27:07,390 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 119#L738true, 265#true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,390 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,390 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,391 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,391 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,447 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 287#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,448 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-07 00:27:07,448 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-07 00:27:07,448 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-07 00:27:07,448 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-07 00:27:07,455 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 287#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,455 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-07 00:27:07,455 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-07 00:27:07,455 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-07 00:27:07,455 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,460 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,460 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,460 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,460 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,460 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,471 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,471 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,471 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,471 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,471 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,477 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][232], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 166#L771-3true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 120#L788-1true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,477 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,477 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,477 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,477 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][232], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 166#L771-3true, 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,478 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][233], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 120#L788-1true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,478 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,478 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][233], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 51#L772-2true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 267#(= ~readerprogress1~0 2), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,479 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,479 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:07,479 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,479 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-07 00:27:07,521 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 244#true, Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 120#L788-1true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,521 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,521 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,521 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,521 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-07 00:27:07,526 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 168#L772-6true, Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,526 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is not cut-off event [2021-12-07 00:27:07,526 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-07 00:27:07,526 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-07 00:27:07,526 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-07 00:27:07,529 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 287#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,529 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-12-07 00:27:07,529 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-07 00:27:07,529 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-07 00:27:07,529 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-07 00:27:07,529 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 84#L787-1true, Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,529 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,530 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,530 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,530 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,530 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-07 00:27:07,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 120#L788-1true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,627 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,627 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,627 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,627 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,742 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][140], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 168#L772-6true, Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 120#L788-1true, 289#(= ~readerprogress2~0 2), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-07 00:27:07,743 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-12-07 00:27:07,743 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:07,743 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:07,743 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-07 00:27:07,792 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,793 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 287#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,793 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,793 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-07 00:27:07,794 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][224], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 287#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 267#(= ~readerprogress1~0 2), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,794 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,794 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,794 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-12-07 00:27:07,794 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-07 00:27:07,890 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][288], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 120#L788-1true, 289#(= ~readerprogress2~0 2), 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-07 00:27:07,890 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,890 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,890 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,890 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:07,890 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-07 00:27:08,094 INFO L129 PetriNetUnfolder]: 8317/19339 cut-off events. [2021-12-07 00:27:08,094 INFO L130 PetriNetUnfolder]: For 25204/26285 co-relation queries the response was YES. [2021-12-07 00:27:08,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49675 conditions, 19339 events. 8317/19339 cut-off events. For 25204/26285 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 207525 event pairs, 1496 based on Foata normal form. 386/18229 useless extension candidates. Maximal degree in co-relation 47890. Up to 5238 conditions per place. [2021-12-07 00:27:08,236 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 140 selfloop transitions, 6 changer transitions 19/328 dead transitions. [2021-12-07 00:27:08,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 328 transitions, 1866 flow [2021-12-07 00:27:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:27:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-07 00:27:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 774 transitions. [2021-12-07 00:27:08,238 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8459016393442623 [2021-12-07 00:27:08,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 774 transitions. [2021-12-07 00:27:08,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 774 transitions. [2021-12-07 00:27:08,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:08,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 774 transitions. [2021-12-07 00:27:08,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 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) [2021-12-07 00:27:08,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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) [2021-12-07 00:27:08,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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) [2021-12-07 00:27:08,242 INFO L186 Difference]: Start difference. First operand has 218 places, 245 transitions, 1081 flow. Second operand 5 states and 774 transitions. [2021-12-07 00:27:08,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 328 transitions, 1866 flow [2021-12-07 00:27:08,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 328 transitions, 1841 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-12-07 00:27:08,357 INFO L242 Difference]: Finished difference. Result has 224 places, 250 transitions, 1131 flow [2021-12-07 00:27:08,357 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1131, PETRI_PLACES=224, PETRI_TRANSITIONS=250} [2021-12-07 00:27:08,358 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 64 predicate places. [2021-12-07 00:27:08,358 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 250 transitions, 1131 flow [2021-12-07 00:27:08,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 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) [2021-12-07 00:27:08,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:08,358 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:08,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:27:08,359 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1045246048, now seen corresponding path program 1 times [2021-12-07 00:27:08,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:08,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149987903] [2021-12-07 00:27:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:08,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:08,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:08,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149987903] [2021-12-07 00:27:08,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149987903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:08,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:08,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:08,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811451570] [2021-12-07 00:27:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:08,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:08,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:08,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-07 00:27:08,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 250 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2021-12-07 00:27:08,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:08,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-07 00:27:08,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:09,726 INFO L129 PetriNetUnfolder]: 3863/12027 cut-off events. [2021-12-07 00:27:09,726 INFO L130 PetriNetUnfolder]: For 13472/13826 co-relation queries the response was YES. [2021-12-07 00:27:09,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26779 conditions, 12027 events. 3863/12027 cut-off events. For 13472/13826 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 133836 event pairs, 939 based on Foata normal form. 114/11109 useless extension candidates. Maximal degree in co-relation 26386. Up to 3848 conditions per place. [2021-12-07 00:27:09,869 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 61 selfloop transitions, 1 changer transitions 51/269 dead transitions. [2021-12-07 00:27:09,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 269 transitions, 1389 flow [2021-12-07 00:27:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:27:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-07 00:27:09,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-07 00:27:09,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-07 00:27:09,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-07 00:27:09,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:09,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-07 00:27:09,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2021-12-07 00:27:09,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:27:09,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:27:09,875 INFO L186 Difference]: Start difference. First operand has 224 places, 250 transitions, 1131 flow. Second operand 3 states and 494 transitions. [2021-12-07 00:27:09,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 269 transitions, 1389 flow [2021-12-07 00:27:09,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 269 transitions, 1378 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-07 00:27:09,928 INFO L242 Difference]: Finished difference. Result has 226 places, 204 transitions, 822 flow [2021-12-07 00:27:09,929 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=226, PETRI_TRANSITIONS=204} [2021-12-07 00:27:09,929 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 66 predicate places. [2021-12-07 00:27:09,929 INFO L470 AbstractCegarLoop]: Abstraction has has 226 places, 204 transitions, 822 flow [2021-12-07 00:27:09,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2021-12-07 00:27:09,930 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:09,930 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:09,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:27:09,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1059151642, now seen corresponding path program 1 times [2021-12-07 00:27:09,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:09,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42894357] [2021-12-07 00:27:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:09,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:09,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42894357] [2021-12-07 00:27:09,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42894357] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:09,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:09,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:27:09,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396685584] [2021-12-07 00:27:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:09,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:27:09,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:09,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:27:09,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:09,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2021-12-07 00:27:09,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 204 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 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) [2021-12-07 00:27:09,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:09,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2021-12-07 00:27:09,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:10,811 INFO L129 PetriNetUnfolder]: 1651/5366 cut-off events. [2021-12-07 00:27:10,812 INFO L130 PetriNetUnfolder]: For 5276/5357 co-relation queries the response was YES. [2021-12-07 00:27:10,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 5366 events. 1651/5366 cut-off events. For 5276/5357 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 55189 event pairs, 483 based on Foata normal form. 42/5120 useless extension candidates. Maximal degree in co-relation 12417. Up to 1768 conditions per place. [2021-12-07 00:27:10,853 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 74 selfloop transitions, 31 changer transitions 11/264 dead transitions. [2021-12-07 00:27:10,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 264 transitions, 1387 flow [2021-12-07 00:27:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:27:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-07 00:27:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-12-07 00:27:10,857 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87743950039032 [2021-12-07 00:27:10,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-12-07 00:27:10,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-12-07 00:27:10,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:10,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-12-07 00:27:10,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 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) [2021-12-07 00:27:10,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2021-12-07 00:27:10,865 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2021-12-07 00:27:10,866 INFO L186 Difference]: Start difference. First operand has 226 places, 204 transitions, 822 flow. Second operand 7 states and 1124 transitions. [2021-12-07 00:27:10,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 264 transitions, 1387 flow [2021-12-07 00:27:10,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 264 transitions, 1338 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-07 00:27:10,894 INFO L242 Difference]: Finished difference. Result has 214 places, 219 transitions, 1008 flow [2021-12-07 00:27:10,894 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1008, PETRI_PLACES=214, PETRI_TRANSITIONS=219} [2021-12-07 00:27:10,895 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 54 predicate places. [2021-12-07 00:27:10,895 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 219 transitions, 1008 flow [2021-12-07 00:27:10,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 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) [2021-12-07 00:27:10,896 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:10,896 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:10,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 00:27:10,896 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1402509722, now seen corresponding path program 1 times [2021-12-07 00:27:10,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:10,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892060101] [2021-12-07 00:27:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:10,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:10,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:10,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892060101] [2021-12-07 00:27:10,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892060101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:10,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:10,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:10,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860129362] [2021-12-07 00:27:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:10,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:10,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:10,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-07 00:27:10,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 219 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2021-12-07 00:27:10,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:10,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-07 00:27:10,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:11,300 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][149], [111#L739-3true, 189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 79#L771-1true, Black: 191#(= ~readerprogress2~0 0), 321#(= ~idx~0 0), 305#true, 101#L786-4true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), Black: 293#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 302#(= ~idx~0 1), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 308#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 186#(= ~readerprogress1~0 0), Black: 309#(<= 1 ~ctr2~0), Black: 307#(= ~ctr2~0 0), 55#L758-3true]) [2021-12-07 00:27:11,300 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-07 00:27:11,300 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-07 00:27:11,300 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-07 00:27:11,300 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-07 00:27:11,378 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][149], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 79#L771-1true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, 321#(= ~idx~0 0), 305#true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), Black: 293#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 302#(= ~idx~0 1), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 308#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 186#(= ~readerprogress1~0 0), Black: 309#(<= 1 ~ctr2~0), Black: 307#(= ~ctr2~0 0), 55#L758-3true]) [2021-12-07 00:27:11,378 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-07 00:27:11,378 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-07 00:27:11,378 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-07 00:27:11,378 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-07 00:27:11,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][149], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 79#L771-1true, Black: 191#(= ~readerprogress2~0 0), 321#(= ~idx~0 0), 87#L788-2true, 305#true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 277#(and (= 2 |qrcu_updaterThread1of1ForFork0_#t~mem20#1|) (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 268#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 275#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 273#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 279#(and (= ~readerprogress1~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 2) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 204#true, 289#(= ~readerprogress2~0 2), Black: 293#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), 267#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 302#(= ~idx~0 1), Black: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 308#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 186#(= ~readerprogress1~0 0), Black: 309#(<= 1 ~ctr2~0), Black: 307#(= ~ctr2~0 0)]) [2021-12-07 00:27:11,433 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2021-12-07 00:27:11,433 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:11,433 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-07 00:27:11,433 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-07 00:27:11,465 INFO L129 PetriNetUnfolder]: 1017/3811 cut-off events. [2021-12-07 00:27:11,465 INFO L130 PetriNetUnfolder]: For 6544/6645 co-relation queries the response was YES. [2021-12-07 00:27:11,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9406 conditions, 3811 events. 1017/3811 cut-off events. For 6544/6645 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 36265 event pairs, 242 based on Foata normal form. 31/3646 useless extension candidates. Maximal degree in co-relation 9372. Up to 964 conditions per place. [2021-12-07 00:27:11,493 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 58 selfloop transitions, 2 changer transitions 5/215 dead transitions. [2021-12-07 00:27:11,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 215 transitions, 1136 flow [2021-12-07 00:27:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:27:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-12-07 00:27:11,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-12-07 00:27:11,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-12-07 00:27:11,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-12-07 00:27:11,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:11,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-12-07 00:27:11,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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) [2021-12-07 00:27:11,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:27:11,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-12-07 00:27:11,498 INFO L186 Difference]: Start difference. First operand has 214 places, 219 transitions, 1008 flow. Second operand 3 states and 488 transitions. [2021-12-07 00:27:11,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 215 transitions, 1136 flow [2021-12-07 00:27:11,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 215 transitions, 1119 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-07 00:27:11,518 INFO L242 Difference]: Finished difference. Result has 205 places, 195 transitions, 854 flow [2021-12-07 00:27:11,519 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2021-12-07 00:27:11,519 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2021-12-07 00:27:11,519 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 854 flow [2021-12-07 00:27:11,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2021-12-07 00:27:11,520 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:11,520 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:11,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 00:27:11,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1154243582, now seen corresponding path program 1 times [2021-12-07 00:27:11,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:11,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489449225] [2021-12-07 00:27:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:11,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:11,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:11,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489449225] [2021-12-07 00:27:11,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489449225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:11,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:11,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:27:11,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871617515] [2021-12-07 00:27:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:11,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:27:11,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:27:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:27:11,638 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:11,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 854 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:11,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:11,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:11,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:12,599 INFO L129 PetriNetUnfolder]: 2306/5765 cut-off events. [2021-12-07 00:27:12,599 INFO L130 PetriNetUnfolder]: For 11523/11648 co-relation queries the response was YES. [2021-12-07 00:27:12,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17439 conditions, 5765 events. 2306/5765 cut-off events. For 11523/11648 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 51985 event pairs, 557 based on Foata normal form. 84/5691 useless extension candidates. Maximal degree in co-relation 17406. Up to 2509 conditions per place. [2021-12-07 00:27:12,631 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 137 selfloop transitions, 46 changer transitions 7/304 dead transitions. [2021-12-07 00:27:12,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 304 transitions, 1962 flow [2021-12-07 00:27:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:27:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-07 00:27:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2021-12-07 00:27:12,635 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2021-12-07 00:27:12,635 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2021-12-07 00:27:12,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2021-12-07 00:27:12,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:12,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2021-12-07 00:27:12,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.72727272727272) internal successors, (1493), 11 states have internal predecessors, (1493), 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) [2021-12-07 00:27:12,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:12,642 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:12,642 INFO L186 Difference]: Start difference. First operand has 205 places, 195 transitions, 854 flow. Second operand 11 states and 1493 transitions. [2021-12-07 00:27:12,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 304 transitions, 1962 flow [2021-12-07 00:27:12,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 304 transitions, 1958 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:27:12,674 INFO L242 Difference]: Finished difference. Result has 217 places, 221 transitions, 1287 flow [2021-12-07 00:27:12,674 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1287, PETRI_PLACES=217, PETRI_TRANSITIONS=221} [2021-12-07 00:27:12,675 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 57 predicate places. [2021-12-07 00:27:12,675 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 221 transitions, 1287 flow [2021-12-07 00:27:12,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:12,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:12,676 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:12,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 00:27:12,676 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1100238120, now seen corresponding path program 2 times [2021-12-07 00:27:12,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204052875] [2021-12-07 00:27:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:12,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:12,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:12,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204052875] [2021-12-07 00:27:12,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204052875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:12,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:12,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:27:12,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995025347] [2021-12-07 00:27:12,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:12,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:27:12,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:27:12,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:27:12,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:12,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 221 transitions, 1287 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:12,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:12,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:12,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:13,731 INFO L129 PetriNetUnfolder]: 2356/6042 cut-off events. [2021-12-07 00:27:13,731 INFO L130 PetriNetUnfolder]: For 17192/17316 co-relation queries the response was YES. [2021-12-07 00:27:13,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19894 conditions, 6042 events. 2356/6042 cut-off events. For 17192/17316 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 55638 event pairs, 622 based on Foata normal form. 105/5952 useless extension candidates. Maximal degree in co-relation 19857. Up to 2395 conditions per place. [2021-12-07 00:27:13,770 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 134 selfloop transitions, 65 changer transitions 31/344 dead transitions. [2021-12-07 00:27:13,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 344 transitions, 2689 flow [2021-12-07 00:27:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:27:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:27:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2021-12-07 00:27:13,774 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2021-12-07 00:27:13,774 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2021-12-07 00:27:13,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2021-12-07 00:27:13,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:13,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2021-12-07 00:27:13,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 134.84615384615384) internal successors, (1753), 13 states have internal predecessors, (1753), 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) [2021-12-07 00:27:13,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 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) [2021-12-07 00:27:13,782 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 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) [2021-12-07 00:27:13,782 INFO L186 Difference]: Start difference. First operand has 217 places, 221 transitions, 1287 flow. Second operand 13 states and 1753 transitions. [2021-12-07 00:27:13,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 344 transitions, 2689 flow [2021-12-07 00:27:13,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 344 transitions, 2626 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-12-07 00:27:13,828 INFO L242 Difference]: Finished difference. Result has 229 places, 237 transitions, 1655 flow [2021-12-07 00:27:13,829 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1655, PETRI_PLACES=229, PETRI_TRANSITIONS=237} [2021-12-07 00:27:13,829 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 69 predicate places. [2021-12-07 00:27:13,829 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 237 transitions, 1655 flow [2021-12-07 00:27:13,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:13,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:13,830 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:13,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 00:27:13,830 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1762457930, now seen corresponding path program 1 times [2021-12-07 00:27:13,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:13,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173737173] [2021-12-07 00:27:13,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:13,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:13,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173737173] [2021-12-07 00:27:13,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173737173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:13,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:13,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:27:13,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650906161] [2021-12-07 00:27:13,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:13,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:27:13,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:13,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:27:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:27:13,928 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:13,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 237 transitions, 1655 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:13,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:13,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:13,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:14,996 INFO L129 PetriNetUnfolder]: 2121/5680 cut-off events. [2021-12-07 00:27:14,996 INFO L130 PetriNetUnfolder]: For 23533/23694 co-relation queries the response was YES. [2021-12-07 00:27:15,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19561 conditions, 5680 events. 2121/5680 cut-off events. For 23533/23694 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 53152 event pairs, 429 based on Foata normal form. 164/5650 useless extension candidates. Maximal degree in co-relation 19519. Up to 1506 conditions per place. [2021-12-07 00:27:15,039 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 148 selfloop transitions, 65 changer transitions 12/339 dead transitions. [2021-12-07 00:27:15,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 339 transitions, 2777 flow [2021-12-07 00:27:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:27:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-07 00:27:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2248 transitions. [2021-12-07 00:27:15,045 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7225972356155577 [2021-12-07 00:27:15,045 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2248 transitions. [2021-12-07 00:27:15,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2248 transitions. [2021-12-07 00:27:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:15,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2248 transitions. [2021-12-07 00:27:15,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 132.23529411764707) internal successors, (2248), 17 states have internal predecessors, (2248), 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) [2021-12-07 00:27:15,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 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) [2021-12-07 00:27:15,055 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 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) [2021-12-07 00:27:15,055 INFO L186 Difference]: Start difference. First operand has 229 places, 237 transitions, 1655 flow. Second operand 17 states and 2248 transitions. [2021-12-07 00:27:15,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 339 transitions, 2777 flow [2021-12-07 00:27:15,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 339 transitions, 2706 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-12-07 00:27:15,123 INFO L242 Difference]: Finished difference. Result has 245 places, 249 transitions, 1877 flow [2021-12-07 00:27:15,123 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1877, PETRI_PLACES=245, PETRI_TRANSITIONS=249} [2021-12-07 00:27:15,123 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 85 predicate places. [2021-12-07 00:27:15,123 INFO L470 AbstractCegarLoop]: Abstraction has has 245 places, 249 transitions, 1877 flow [2021-12-07 00:27:15,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:15,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:15,124 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:15,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 00:27:15,124 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2134583572, now seen corresponding path program 3 times [2021-12-07 00:27:15,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:15,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598384936] [2021-12-07 00:27:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:15,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:15,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598384936] [2021-12-07 00:27:15,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598384936] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:15,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:15,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:27:15,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677202642] [2021-12-07 00:27:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:15,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:27:15,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:27:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:27:15,221 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:15,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 249 transitions, 1877 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:15,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:15,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:15,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:16,144 INFO L129 PetriNetUnfolder]: 2031/5501 cut-off events. [2021-12-07 00:27:16,144 INFO L130 PetriNetUnfolder]: For 27843/28037 co-relation queries the response was YES. [2021-12-07 00:27:16,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19643 conditions, 5501 events. 2031/5501 cut-off events. For 27843/28037 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 51591 event pairs, 615 based on Foata normal form. 181/5496 useless extension candidates. Maximal degree in co-relation 19596. Up to 2045 conditions per place. [2021-12-07 00:27:16,184 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 160 selfloop transitions, 65 changer transitions 15/354 dead transitions. [2021-12-07 00:27:16,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 354 transitions, 3122 flow [2021-12-07 00:27:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:27:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:27:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2021-12-07 00:27:16,187 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2021-12-07 00:27:16,187 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2021-12-07 00:27:16,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2021-12-07 00:27:16,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:16,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2021-12-07 00:27:16,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.08333333333334) internal successors, (1633), 12 states have internal predecessors, (1633), 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) [2021-12-07 00:27:16,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:16,192 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:16,192 INFO L186 Difference]: Start difference. First operand has 245 places, 249 transitions, 1877 flow. Second operand 12 states and 1633 transitions. [2021-12-07 00:27:16,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 354 transitions, 3122 flow [2021-12-07 00:27:16,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 354 transitions, 3085 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-12-07 00:27:16,277 INFO L242 Difference]: Finished difference. Result has 256 places, 258 transitions, 2181 flow [2021-12-07 00:27:16,277 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2181, PETRI_PLACES=256, PETRI_TRANSITIONS=258} [2021-12-07 00:27:16,277 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 96 predicate places. [2021-12-07 00:27:16,278 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 258 transitions, 2181 flow [2021-12-07 00:27:16,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 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) [2021-12-07 00:27:16,278 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:16,278 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:16,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 00:27:16,278 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1082267634, now seen corresponding path program 2 times [2021-12-07 00:27:16,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:16,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082819068] [2021-12-07 00:27:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:16,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:16,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:16,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082819068] [2021-12-07 00:27:16,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082819068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:16,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:16,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:27:16,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740266781] [2021-12-07 00:27:16,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:16,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:27:16,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:16,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:27:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:27:16,371 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:16,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 258 transitions, 2181 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:16,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:16,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:16,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:17,395 INFO L129 PetriNetUnfolder]: 1999/5466 cut-off events. [2021-12-07 00:27:17,395 INFO L130 PetriNetUnfolder]: For 35002/35200 co-relation queries the response was YES. [2021-12-07 00:27:17,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20590 conditions, 5466 events. 1999/5466 cut-off events. For 35002/35200 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 51345 event pairs, 416 based on Foata normal form. 174/5459 useless extension candidates. Maximal degree in co-relation 20539. Up to 1274 conditions per place. [2021-12-07 00:27:17,437 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 159 selfloop transitions, 68 changer transitions 31/372 dead transitions. [2021-12-07 00:27:17,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 372 transitions, 3535 flow [2021-12-07 00:27:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:27:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-07 00:27:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2021-12-07 00:27:17,439 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2021-12-07 00:27:17,440 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2021-12-07 00:27:17,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2021-12-07 00:27:17,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:17,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2021-12-07 00:27:17,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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) [2021-12-07 00:27:17,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 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) [2021-12-07 00:27:17,446 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 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) [2021-12-07 00:27:17,446 INFO L186 Difference]: Start difference. First operand has 256 places, 258 transitions, 2181 flow. Second operand 16 states and 2144 transitions. [2021-12-07 00:27:17,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 372 transitions, 3535 flow [2021-12-07 00:27:17,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 372 transitions, 3440 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-12-07 00:27:17,552 INFO L242 Difference]: Finished difference. Result has 271 places, 262 transitions, 2353 flow [2021-12-07 00:27:17,552 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2353, PETRI_PLACES=271, PETRI_TRANSITIONS=262} [2021-12-07 00:27:17,552 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2021-12-07 00:27:17,552 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 262 transitions, 2353 flow [2021-12-07 00:27:17,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:17,553 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:17,553 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:17,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 00:27:17,553 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash 886831074, now seen corresponding path program 3 times [2021-12-07 00:27:17,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:17,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921256339] [2021-12-07 00:27:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:17,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:17,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921256339] [2021-12-07 00:27:17,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921256339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:17,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:17,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:27:17,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459985173] [2021-12-07 00:27:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:17,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:27:17,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:27:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:27:17,637 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:17,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 262 transitions, 2353 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:17,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:17,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:17,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:18,785 INFO L129 PetriNetUnfolder]: 1968/5429 cut-off events. [2021-12-07 00:27:18,785 INFO L130 PetriNetUnfolder]: For 43283/43482 co-relation queries the response was YES. [2021-12-07 00:27:18,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20883 conditions, 5429 events. 1968/5429 cut-off events. For 43283/43482 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 51036 event pairs, 414 based on Foata normal form. 197/5448 useless extension candidates. Maximal degree in co-relation 20827. Up to 1264 conditions per place. [2021-12-07 00:27:18,828 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 145 selfloop transitions, 79 changer transitions 11/349 dead transitions. [2021-12-07 00:27:18,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 349 transitions, 3380 flow [2021-12-07 00:27:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 00:27:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-07 00:27:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2366 transitions. [2021-12-07 00:27:18,831 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7182756527018822 [2021-12-07 00:27:18,831 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2366 transitions. [2021-12-07 00:27:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2366 transitions. [2021-12-07 00:27:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2366 transitions. [2021-12-07 00:27:18,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.44444444444446) internal successors, (2366), 18 states have internal predecessors, (2366), 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) [2021-12-07 00:27:18,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 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) [2021-12-07 00:27:18,837 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 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) [2021-12-07 00:27:18,837 INFO L186 Difference]: Start difference. First operand has 271 places, 262 transitions, 2353 flow. Second operand 18 states and 2366 transitions. [2021-12-07 00:27:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 349 transitions, 3380 flow [2021-12-07 00:27:18,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 349 transitions, 3296 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-12-07 00:27:18,976 INFO L242 Difference]: Finished difference. Result has 286 places, 269 transitions, 2582 flow [2021-12-07 00:27:18,977 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2582, PETRI_PLACES=286, PETRI_TRANSITIONS=269} [2021-12-07 00:27:18,977 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 126 predicate places. [2021-12-07 00:27:18,977 INFO L470 AbstractCegarLoop]: Abstraction has has 286 places, 269 transitions, 2582 flow [2021-12-07 00:27:18,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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) [2021-12-07 00:27:18,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:18,978 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:18,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 00:27:18,978 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1651917844, now seen corresponding path program 1 times [2021-12-07 00:27:18,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879537167] [2021-12-07 00:27:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:18,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:19,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879537167] [2021-12-07 00:27:19,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879537167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:19,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:19,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:27:19,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017650454] [2021-12-07 00:27:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:19,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:27:19,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:27:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:27:19,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:19,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 269 transitions, 2582 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 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) [2021-12-07 00:27:19,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:19,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:19,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:20,082 INFO L129 PetriNetUnfolder]: 1918/5399 cut-off events. [2021-12-07 00:27:20,082 INFO L130 PetriNetUnfolder]: For 51116/51407 co-relation queries the response was YES. [2021-12-07 00:27:20,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22010 conditions, 5399 events. 1918/5399 cut-off events. For 51116/51407 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 51077 event pairs, 195 based on Foata normal form. 284/5511 useless extension candidates. Maximal degree in co-relation 21949. Up to 1409 conditions per place. [2021-12-07 00:27:20,124 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 183 selfloop transitions, 64 changer transitions 30/391 dead transitions. [2021-12-07 00:27:20,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 391 transitions, 4228 flow [2021-12-07 00:27:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:27:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:27:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2021-12-07 00:27:20,126 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2021-12-07 00:27:20,126 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2021-12-07 00:27:20,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2021-12-07 00:27:20,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:20,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2021-12-07 00:27:20,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.58333333333334) internal successors, (1639), 12 states have internal predecessors, (1639), 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) [2021-12-07 00:27:20,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:20,130 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:20,130 INFO L186 Difference]: Start difference. First operand has 286 places, 269 transitions, 2582 flow. Second operand 12 states and 1639 transitions. [2021-12-07 00:27:20,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 391 transitions, 4228 flow [2021-12-07 00:27:20,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 391 transitions, 4027 flow, removed 56 selfloop flow, removed 9 redundant places. [2021-12-07 00:27:20,273 INFO L242 Difference]: Finished difference. Result has 293 places, 286 transitions, 2921 flow [2021-12-07 00:27:20,274 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2921, PETRI_PLACES=293, PETRI_TRANSITIONS=286} [2021-12-07 00:27:20,274 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 133 predicate places. [2021-12-07 00:27:20,274 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 286 transitions, 2921 flow [2021-12-07 00:27:20,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 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) [2021-12-07 00:27:20,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:20,275 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:20,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 00:27:20,275 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1927006464, now seen corresponding path program 1 times [2021-12-07 00:27:20,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637028924] [2021-12-07 00:27:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:20,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:20,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637028924] [2021-12-07 00:27:20,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637028924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:20,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:20,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:27:20,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700750801] [2021-12-07 00:27:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:20,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:27:20,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:27:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:27:20,359 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:20,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 286 transitions, 2921 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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) [2021-12-07 00:27:20,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:20,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:20,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:21,394 INFO L129 PetriNetUnfolder]: 1600/5108 cut-off events. [2021-12-07 00:27:21,394 INFO L130 PetriNetUnfolder]: For 48735/49012 co-relation queries the response was YES. [2021-12-07 00:27:21,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20163 conditions, 5108 events. 1600/5108 cut-off events. For 48735/49012 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 49576 event pairs, 254 based on Foata normal form. 250/5190 useless extension candidates. Maximal degree in co-relation 20099. Up to 713 conditions per place. [2021-12-07 00:27:21,439 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 166 selfloop transitions, 79 changer transitions 38/397 dead transitions. [2021-12-07 00:27:21,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 397 transitions, 4325 flow [2021-12-07 00:27:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:27:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-07 00:27:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2021-12-07 00:27:21,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2021-12-07 00:27:21,441 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2021-12-07 00:27:21,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2021-12-07 00:27:21,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:21,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2021-12-07 00:27:21,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.125) internal successors, (2146), 16 states have internal predecessors, (2146), 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) [2021-12-07 00:27:21,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 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) [2021-12-07 00:27:21,446 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 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) [2021-12-07 00:27:21,446 INFO L186 Difference]: Start difference. First operand has 293 places, 286 transitions, 2921 flow. Second operand 16 states and 2146 transitions. [2021-12-07 00:27:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 397 transitions, 4325 flow [2021-12-07 00:27:21,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 397 transitions, 4239 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-12-07 00:27:21,598 INFO L242 Difference]: Finished difference. Result has 310 places, 288 transitions, 3076 flow [2021-12-07 00:27:21,599 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2850, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3076, PETRI_PLACES=310, PETRI_TRANSITIONS=288} [2021-12-07 00:27:21,599 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 150 predicate places. [2021-12-07 00:27:21,599 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 288 transitions, 3076 flow [2021-12-07 00:27:21,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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) [2021-12-07 00:27:21,599 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:21,599 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:21,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 00:27:21,600 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1427474320, now seen corresponding path program 1 times [2021-12-07 00:27:21,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:21,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356857860] [2021-12-07 00:27:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:21,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:21,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356857860] [2021-12-07 00:27:21,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356857860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:21,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:21,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:27:21,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403890635] [2021-12-07 00:27:21,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:21,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:27:21,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:27:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:27:21,687 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:21,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 288 transitions, 3076 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 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) [2021-12-07 00:27:21,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:21,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:21,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:22,630 INFO L129 PetriNetUnfolder]: 1496/4772 cut-off events. [2021-12-07 00:27:22,630 INFO L130 PetriNetUnfolder]: For 52106/52392 co-relation queries the response was YES. [2021-12-07 00:27:22,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19422 conditions, 4772 events. 1496/4772 cut-off events. For 52106/52392 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 45700 event pairs, 372 based on Foata normal form. 223/4820 useless extension candidates. Maximal degree in co-relation 19353. Up to 1359 conditions per place. [2021-12-07 00:27:22,674 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 166 selfloop transitions, 73 changer transitions 17/370 dead transitions. [2021-12-07 00:27:22,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 370 transitions, 4253 flow [2021-12-07 00:27:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:27:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:27:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2021-12-07 00:27:22,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2021-12-07 00:27:22,676 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2021-12-07 00:27:22,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2021-12-07 00:27:22,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:22,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2021-12-07 00:27:22,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.83333333333334) internal successors, (1618), 12 states have internal predecessors, (1618), 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) [2021-12-07 00:27:22,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:22,680 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:22,680 INFO L186 Difference]: Start difference. First operand has 310 places, 288 transitions, 3076 flow. Second operand 12 states and 1618 transitions. [2021-12-07 00:27:22,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 370 transitions, 4253 flow [2021-12-07 00:27:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 370 transitions, 4092 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-12-07 00:27:22,854 INFO L242 Difference]: Finished difference. Result has 314 places, 290 transitions, 3207 flow [2021-12-07 00:27:22,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3207, PETRI_PLACES=314, PETRI_TRANSITIONS=290} [2021-12-07 00:27:22,855 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 154 predicate places. [2021-12-07 00:27:22,855 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 290 transitions, 3207 flow [2021-12-07 00:27:22,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 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) [2021-12-07 00:27:22,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:22,856 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:22,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 00:27:22,856 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash -378757932, now seen corresponding path program 2 times [2021-12-07 00:27:22,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403889945] [2021-12-07 00:27:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:22,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:22,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403889945] [2021-12-07 00:27:22,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403889945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:22,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:22,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:27:22,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911327867] [2021-12-07 00:27:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:22,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:27:22,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:27:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:27:22,943 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-07 00:27:22,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 290 transitions, 3207 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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) [2021-12-07 00:27:22,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:22,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-07 00:27:22,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:23,877 INFO L129 PetriNetUnfolder]: 1243/4374 cut-off events. [2021-12-07 00:27:23,878 INFO L130 PetriNetUnfolder]: For 52528/52797 co-relation queries the response was YES. [2021-12-07 00:27:23,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17763 conditions, 4374 events. 1243/4374 cut-off events. For 52528/52797 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 42373 event pairs, 252 based on Foata normal form. 222/4445 useless extension candidates. Maximal degree in co-relation 17694. Up to 654 conditions per place. [2021-12-07 00:27:23,918 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 149 selfloop transitions, 90 changer transitions 22/370 dead transitions. [2021-12-07 00:27:23,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 370 transitions, 4283 flow [2021-12-07 00:27:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 00:27:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-07 00:27:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2363 transitions. [2021-12-07 00:27:23,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173649058894961 [2021-12-07 00:27:23,921 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2363 transitions. [2021-12-07 00:27:23,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2363 transitions. [2021-12-07 00:27:23,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:23,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2363 transitions. [2021-12-07 00:27:23,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.27777777777777) internal successors, (2363), 18 states have internal predecessors, (2363), 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) [2021-12-07 00:27:23,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 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) [2021-12-07 00:27:23,926 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 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) [2021-12-07 00:27:23,926 INFO L186 Difference]: Start difference. First operand has 314 places, 290 transitions, 3207 flow. Second operand 18 states and 2363 transitions. [2021-12-07 00:27:23,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 370 transitions, 4283 flow [2021-12-07 00:27:24,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 370 transitions, 4206 flow, removed 1 selfloop flow, removed 7 redundant places. [2021-12-07 00:27:24,112 INFO L242 Difference]: Finished difference. Result has 325 places, 281 transitions, 3296 flow [2021-12-07 00:27:24,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3296, PETRI_PLACES=325, PETRI_TRANSITIONS=281} [2021-12-07 00:27:24,112 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 165 predicate places. [2021-12-07 00:27:24,113 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 281 transitions, 3296 flow [2021-12-07 00:27:24,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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) [2021-12-07 00:27:24,113 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:24,113 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:24,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 00:27:24,113 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 93928347, now seen corresponding path program 1 times [2021-12-07 00:27:24,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:24,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602678792] [2021-12-07 00:27:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:24,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:24,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602678792] [2021-12-07 00:27:24,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602678792] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:24,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:24,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:24,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279217942] [2021-12-07 00:27:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:24,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:24,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:24,166 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:24,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 281 transitions, 3296 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:24,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:24,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:24,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:24,746 INFO L129 PetriNetUnfolder]: 745/3046 cut-off events. [2021-12-07 00:27:24,746 INFO L130 PetriNetUnfolder]: For 34876/35012 co-relation queries the response was YES. [2021-12-07 00:27:24,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12424 conditions, 3046 events. 745/3046 cut-off events. For 34876/35012 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 27495 event pairs, 149 based on Foata normal form. 63/3002 useless extension candidates. Maximal degree in co-relation 12353. Up to 441 conditions per place. [2021-12-07 00:27:24,775 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 111 selfloop transitions, 37 changer transitions 60/352 dead transitions. [2021-12-07 00:27:24,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 352 transitions, 4229 flow [2021-12-07 00:27:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:27:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-07 00:27:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2021-12-07 00:27:24,777 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2021-12-07 00:27:24,777 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2021-12-07 00:27:24,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2021-12-07 00:27:24,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:24,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2021-12-07 00:27:24,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.72727272727272) internal successors, (1625), 11 states have internal predecessors, (1625), 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) [2021-12-07 00:27:24,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:24,781 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:24,781 INFO L186 Difference]: Start difference. First operand has 325 places, 281 transitions, 3296 flow. Second operand 11 states and 1625 transitions. [2021-12-07 00:27:24,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 352 transitions, 4229 flow [2021-12-07 00:27:24,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 352 transitions, 3855 flow, removed 25 selfloop flow, removed 23 redundant places. [2021-12-07 00:27:24,888 INFO L242 Difference]: Finished difference. Result has 310 places, 249 transitions, 2469 flow [2021-12-07 00:27:24,888 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2469, PETRI_PLACES=310, PETRI_TRANSITIONS=249} [2021-12-07 00:27:24,889 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 150 predicate places. [2021-12-07 00:27:24,889 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 249 transitions, 2469 flow [2021-12-07 00:27:24,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:24,889 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:24,889 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:24,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 00:27:24,889 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1711870497, now seen corresponding path program 2 times [2021-12-07 00:27:24,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015482966] [2021-12-07 00:27:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:24,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:24,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015482966] [2021-12-07 00:27:24,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015482966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:24,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:24,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:24,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072634405] [2021-12-07 00:27:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:24,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:24,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:24,949 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:24,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 249 transitions, 2469 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:24,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:24,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:24,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:25,475 INFO L129 PetriNetUnfolder]: 664/2550 cut-off events. [2021-12-07 00:27:25,475 INFO L130 PetriNetUnfolder]: For 22876/23012 co-relation queries the response was YES. [2021-12-07 00:27:25,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9818 conditions, 2550 events. 664/2550 cut-off events. For 22876/23012 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 21639 event pairs, 133 based on Foata normal form. 72/2512 useless extension candidates. Maximal degree in co-relation 9754. Up to 446 conditions per place. [2021-12-07 00:27:25,499 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 112 selfloop transitions, 45 changer transitions 25/326 dead transitions. [2021-12-07 00:27:25,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 326 transitions, 3523 flow [2021-12-07 00:27:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:27:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:27:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2021-12-07 00:27:25,501 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2021-12-07 00:27:25,501 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2021-12-07 00:27:25,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2021-12-07 00:27:25,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:25,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2021-12-07 00:27:25,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.25) internal successors, (1767), 12 states have internal predecessors, (1767), 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) [2021-12-07 00:27:25,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:25,505 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:25,505 INFO L186 Difference]: Start difference. First operand has 310 places, 249 transitions, 2469 flow. Second operand 12 states and 1767 transitions. [2021-12-07 00:27:25,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 326 transitions, 3523 flow [2021-12-07 00:27:25,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 326 transitions, 3083 flow, removed 39 selfloop flow, removed 31 redundant places. [2021-12-07 00:27:25,563 INFO L242 Difference]: Finished difference. Result has 295 places, 260 transitions, 2385 flow [2021-12-07 00:27:25,563 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2385, PETRI_PLACES=295, PETRI_TRANSITIONS=260} [2021-12-07 00:27:25,564 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 135 predicate places. [2021-12-07 00:27:25,564 INFO L470 AbstractCegarLoop]: Abstraction has has 295 places, 260 transitions, 2385 flow [2021-12-07 00:27:25,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:25,564 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:25,564 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:25,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 00:27:25,565 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash 598112123, now seen corresponding path program 3 times [2021-12-07 00:27:25,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:25,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025353048] [2021-12-07 00:27:25,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:25,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:25,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:25,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025353048] [2021-12-07 00:27:25,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025353048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:25,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:25,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:25,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571952834] [2021-12-07 00:27:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:25,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:25,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:25,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:25,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 260 transitions, 2385 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:25,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:25,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:25,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:26,049 INFO L129 PetriNetUnfolder]: 606/2380 cut-off events. [2021-12-07 00:27:26,049 INFO L130 PetriNetUnfolder]: For 16586/16713 co-relation queries the response was YES. [2021-12-07 00:27:26,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8473 conditions, 2380 events. 606/2380 cut-off events. For 16586/16713 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 19692 event pairs, 123 based on Foata normal form. 71/2334 useless extension candidates. Maximal degree in co-relation 8418. Up to 365 conditions per place. [2021-12-07 00:27:26,069 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 107 selfloop transitions, 52 changer transitions 36/339 dead transitions. [2021-12-07 00:27:26,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 339 transitions, 3423 flow [2021-12-07 00:27:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:27:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:27:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2021-12-07 00:27:26,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2021-12-07 00:27:26,071 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2021-12-07 00:27:26,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2021-12-07 00:27:26,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:26,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2021-12-07 00:27:26,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.41666666666666) internal successors, (1769), 12 states have internal predecessors, (1769), 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) [2021-12-07 00:27:26,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:26,075 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2021-12-07 00:27:26,075 INFO L186 Difference]: Start difference. First operand has 295 places, 260 transitions, 2385 flow. Second operand 12 states and 1769 transitions. [2021-12-07 00:27:26,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 339 transitions, 3423 flow [2021-12-07 00:27:26,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 339 transitions, 3350 flow, removed 21 selfloop flow, removed 4 redundant places. [2021-12-07 00:27:26,117 INFO L242 Difference]: Finished difference. Result has 306 places, 266 transitions, 2548 flow [2021-12-07 00:27:26,117 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2548, PETRI_PLACES=306, PETRI_TRANSITIONS=266} [2021-12-07 00:27:26,117 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 146 predicate places. [2021-12-07 00:27:26,118 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 266 transitions, 2548 flow [2021-12-07 00:27:26,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:26,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:26,118 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:26,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 00:27:26,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 310787751, now seen corresponding path program 4 times [2021-12-07 00:27:26,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:26,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86865723] [2021-12-07 00:27:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:26,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:26,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:26,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86865723] [2021-12-07 00:27:26,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86865723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:26,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:26,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:26,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272638738] [2021-12-07 00:27:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:26,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:26,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:26,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:26,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-07 00:27:26,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 266 transitions, 2548 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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) [2021-12-07 00:27:26,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:26,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-07 00:27:26,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:26,504 INFO L129 PetriNetUnfolder]: 481/2284 cut-off events. [2021-12-07 00:27:26,504 INFO L130 PetriNetUnfolder]: For 18316/18449 co-relation queries the response was YES. [2021-12-07 00:27:26,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 2284 events. 481/2284 cut-off events. For 18316/18449 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 19250 event pairs, 121 based on Foata normal form. 65/2207 useless extension candidates. Maximal degree in co-relation 7997. Up to 404 conditions per place. [2021-12-07 00:27:26,526 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 92 selfloop transitions, 10 changer transitions 8/288 dead transitions. [2021-12-07 00:27:26,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 288 transitions, 2963 flow [2021-12-07 00:27:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:27:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-12-07 00:27:26,527 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2021-12-07 00:27:26,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-12-07 00:27:26,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-12-07 00:27:26,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:26,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-12-07 00:27:26,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 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) [2021-12-07 00:27:26,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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) [2021-12-07 00:27:26,528 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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) [2021-12-07 00:27:26,529 INFO L186 Difference]: Start difference. First operand has 306 places, 266 transitions, 2548 flow. Second operand 4 states and 643 transitions. [2021-12-07 00:27:26,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 288 transitions, 2963 flow [2021-12-07 00:27:26,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 288 transitions, 2833 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-07 00:27:26,572 INFO L242 Difference]: Finished difference. Result has 303 places, 265 transitions, 2458 flow [2021-12-07 00:27:26,573 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2458, PETRI_PLACES=303, PETRI_TRANSITIONS=265} [2021-12-07 00:27:26,573 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 143 predicate places. [2021-12-07 00:27:26,573 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 265 transitions, 2458 flow [2021-12-07 00:27:26,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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) [2021-12-07 00:27:26,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:26,573 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:26,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 00:27:26,574 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 71557963, now seen corresponding path program 5 times [2021-12-07 00:27:26,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:26,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711973628] [2021-12-07 00:27:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:26,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:26,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711973628] [2021-12-07 00:27:26,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711973628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:26,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:26,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:26,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529570528] [2021-12-07 00:27:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:26,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:26,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:26,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:26,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 265 transitions, 2458 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:26,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:26,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:26,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:27,095 INFO L129 PetriNetUnfolder]: 559/2402 cut-off events. [2021-12-07 00:27:27,095 INFO L130 PetriNetUnfolder]: For 18300/18519 co-relation queries the response was YES. [2021-12-07 00:27:27,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8670 conditions, 2402 events. 559/2402 cut-off events. For 18300/18519 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20325 event pairs, 135 based on Foata normal form. 118/2388 useless extension candidates. Maximal degree in co-relation 8609. Up to 345 conditions per place. [2021-12-07 00:27:27,117 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 102 selfloop transitions, 52 changer transitions 42/340 dead transitions. [2021-12-07 00:27:27,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 340 transitions, 3564 flow [2021-12-07 00:27:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:27:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-07 00:27:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2021-12-07 00:27:27,119 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2021-12-07 00:27:27,119 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2021-12-07 00:27:27,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2021-12-07 00:27:27,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:27,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2021-12-07 00:27:27,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.21428571428572) internal successors, (2047), 14 states have internal predecessors, (2047), 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) [2021-12-07 00:27:27,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 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) [2021-12-07 00:27:27,123 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 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) [2021-12-07 00:27:27,123 INFO L186 Difference]: Start difference. First operand has 303 places, 265 transitions, 2458 flow. Second operand 14 states and 2047 transitions. [2021-12-07 00:27:27,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 340 transitions, 3564 flow [2021-12-07 00:27:27,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 340 transitions, 3508 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-12-07 00:27:27,167 INFO L242 Difference]: Finished difference. Result has 317 places, 265 transitions, 2609 flow [2021-12-07 00:27:27,168 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2609, PETRI_PLACES=317, PETRI_TRANSITIONS=265} [2021-12-07 00:27:27,168 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 157 predicate places. [2021-12-07 00:27:27,168 INFO L470 AbstractCegarLoop]: Abstraction has has 317 places, 265 transitions, 2609 flow [2021-12-07 00:27:27,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:27,169 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:27,169 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:27,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 00:27:27,169 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1568098547, now seen corresponding path program 1 times [2021-12-07 00:27:27,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036759682] [2021-12-07 00:27:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:27,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:27,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:27,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036759682] [2021-12-07 00:27:27,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036759682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:27,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:27,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-07 00:27:27,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014322736] [2021-12-07 00:27:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:27,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-07 00:27:27,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 00:27:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-07 00:27:27,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 183 [2021-12-07 00:27:27,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 265 transitions, 2609 flow. Second operand has 13 states, 13 states have (on average 124.23076923076923) internal successors, (1615), 13 states have internal predecessors, (1615), 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) [2021-12-07 00:27:27,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:27,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 183 [2021-12-07 00:27:27,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:28,227 INFO L129 PetriNetUnfolder]: 963/3597 cut-off events. [2021-12-07 00:27:28,227 INFO L130 PetriNetUnfolder]: For 29078/29329 co-relation queries the response was YES. [2021-12-07 00:27:28,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13203 conditions, 3597 events. 963/3597 cut-off events. For 29078/29329 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 32920 event pairs, 181 based on Foata normal form. 154/3567 useless extension candidates. Maximal degree in co-relation 13139. Up to 349 conditions per place. [2021-12-07 00:27:28,255 INFO L132 encePairwiseOnDemand]: 163/183 looper letters, 171 selfloop transitions, 119 changer transitions 76/472 dead transitions. [2021-12-07 00:27:28,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 472 transitions, 5100 flow [2021-12-07 00:27:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-07 00:27:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-12-07 00:27:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5246 transitions. [2021-12-07 00:27:28,260 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6991869918699187 [2021-12-07 00:27:28,260 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 5246 transitions. [2021-12-07 00:27:28,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 5246 transitions. [2021-12-07 00:27:28,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:28,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 5246 transitions. [2021-12-07 00:27:28,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 127.95121951219512) internal successors, (5246), 41 states have internal predecessors, (5246), 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) [2021-12-07 00:27:28,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 183.0) internal successors, (7686), 42 states have internal predecessors, (7686), 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) [2021-12-07 00:27:28,273 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 183.0) internal successors, (7686), 42 states have internal predecessors, (7686), 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) [2021-12-07 00:27:28,273 INFO L186 Difference]: Start difference. First operand has 317 places, 265 transitions, 2609 flow. Second operand 41 states and 5246 transitions. [2021-12-07 00:27:28,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 472 transitions, 5100 flow [2021-12-07 00:27:28,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 472 transitions, 4897 flow, removed 22 selfloop flow, removed 13 redundant places. [2021-12-07 00:27:28,336 INFO L242 Difference]: Finished difference. Result has 358 places, 302 transitions, 3199 flow [2021-12-07 00:27:28,336 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=3199, PETRI_PLACES=358, PETRI_TRANSITIONS=302} [2021-12-07 00:27:28,336 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 198 predicate places. [2021-12-07 00:27:28,337 INFO L470 AbstractCegarLoop]: Abstraction has has 358 places, 302 transitions, 3199 flow [2021-12-07 00:27:28,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 124.23076923076923) internal successors, (1615), 13 states have internal predecessors, (1615), 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) [2021-12-07 00:27:28,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:28,337 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:28,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-07 00:27:28,337 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1974297149, now seen corresponding path program 2 times [2021-12-07 00:27:28,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:28,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690309176] [2021-12-07 00:27:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:28,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:28,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:28,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690309176] [2021-12-07 00:27:28,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690309176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:28,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:28,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:28,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268545381] [2021-12-07 00:27:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:28,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:28,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:28,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:28,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 302 transitions, 3199 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:28,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:28,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:28,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:28,792 INFO L129 PetriNetUnfolder]: 474/2084 cut-off events. [2021-12-07 00:27:28,792 INFO L130 PetriNetUnfolder]: For 17982/18164 co-relation queries the response was YES. [2021-12-07 00:27:28,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8299 conditions, 2084 events. 474/2084 cut-off events. For 17982/18164 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 16784 event pairs, 86 based on Foata normal form. 114/2095 useless extension candidates. Maximal degree in co-relation 8226. Up to 298 conditions per place. [2021-12-07 00:27:28,813 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 101 selfloop transitions, 60 changer transitions 35/331 dead transitions. [2021-12-07 00:27:28,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 331 transitions, 3830 flow [2021-12-07 00:27:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:27:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-07 00:27:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1595 transitions. [2021-12-07 00:27:28,815 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7923497267759563 [2021-12-07 00:27:28,815 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1595 transitions. [2021-12-07 00:27:28,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1595 transitions. [2021-12-07 00:27:28,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:28,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1595 transitions. [2021-12-07 00:27:28,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.0) internal successors, (1595), 11 states have internal predecessors, (1595), 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) [2021-12-07 00:27:28,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:28,818 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2021-12-07 00:27:28,818 INFO L186 Difference]: Start difference. First operand has 358 places, 302 transitions, 3199 flow. Second operand 11 states and 1595 transitions. [2021-12-07 00:27:28,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 331 transitions, 3830 flow [2021-12-07 00:27:28,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 331 transitions, 3585 flow, removed 48 selfloop flow, removed 19 redundant places. [2021-12-07 00:27:28,878 INFO L242 Difference]: Finished difference. Result has 343 places, 274 transitions, 2604 flow [2021-12-07 00:27:28,879 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2966, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2604, PETRI_PLACES=343, PETRI_TRANSITIONS=274} [2021-12-07 00:27:28,879 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 183 predicate places. [2021-12-07 00:27:28,879 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 274 transitions, 2604 flow [2021-12-07 00:27:28,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:28,879 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:28,879 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:28,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-07 00:27:28,880 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 723996397, now seen corresponding path program 3 times [2021-12-07 00:27:28,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025937032] [2021-12-07 00:27:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:28,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:28,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025937032] [2021-12-07 00:27:28,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025937032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:28,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:28,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:28,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7944352] [2021-12-07 00:27:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:28,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:28,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:28,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:28,932 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:28,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 274 transitions, 2604 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:28,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:28,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:28,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:29,278 INFO L129 PetriNetUnfolder]: 342/1736 cut-off events. [2021-12-07 00:27:29,278 INFO L130 PetriNetUnfolder]: For 11049/11195 co-relation queries the response was YES. [2021-12-07 00:27:29,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6005 conditions, 1736 events. 342/1736 cut-off events. For 11049/11195 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 13170 event pairs, 68 based on Foata normal form. 104/1742 useless extension candidates. Maximal degree in co-relation 5940. Up to 191 conditions per place. [2021-12-07 00:27:29,293 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 103 selfloop transitions, 57 changer transitions 42/328 dead transitions. [2021-12-07 00:27:29,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 328 transitions, 3620 flow [2021-12-07 00:27:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:27:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:27:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1464 transitions. [2021-12-07 00:27:29,295 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-12-07 00:27:29,295 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1464 transitions. [2021-12-07 00:27:29,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1464 transitions. [2021-12-07 00:27:29,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:29,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1464 transitions. [2021-12-07 00:27:29,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.4) internal successors, (1464), 10 states have internal predecessors, (1464), 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) [2021-12-07 00:27:29,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:29,298 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:29,298 INFO L186 Difference]: Start difference. First operand has 343 places, 274 transitions, 2604 flow. Second operand 10 states and 1464 transitions. [2021-12-07 00:27:29,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 328 transitions, 3620 flow [2021-12-07 00:27:29,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 328 transitions, 3121 flow, removed 9 selfloop flow, removed 39 redundant places. [2021-12-07 00:27:29,334 INFO L242 Difference]: Finished difference. Result has 311 places, 260 transitions, 2290 flow [2021-12-07 00:27:29,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2290, PETRI_PLACES=311, PETRI_TRANSITIONS=260} [2021-12-07 00:27:29,335 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 151 predicate places. [2021-12-07 00:27:29,335 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 260 transitions, 2290 flow [2021-12-07 00:27:29,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:29,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:29,335 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:29,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-07 00:27:29,335 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1199757880, now seen corresponding path program 1 times [2021-12-07 00:27:29,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491465482] [2021-12-07 00:27:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:29,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:29,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:29,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491465482] [2021-12-07 00:27:29,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491465482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:29,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:29,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:29,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248412740] [2021-12-07 00:27:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:29,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:29,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:29,387 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:29,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 260 transitions, 2290 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:29,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:29,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:29,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:29,619 INFO L129 PetriNetUnfolder]: 254/1233 cut-off events. [2021-12-07 00:27:29,619 INFO L130 PetriNetUnfolder]: For 6897/7057 co-relation queries the response was YES. [2021-12-07 00:27:29,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 1233 events. 254/1233 cut-off events. For 6897/7057 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8208 event pairs, 54 based on Foata normal form. 103/1241 useless extension candidates. Maximal degree in co-relation 4046. Up to 150 conditions per place. [2021-12-07 00:27:29,629 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 55 selfloop transitions, 27 changer transitions 89/281 dead transitions. [2021-12-07 00:27:29,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 281 transitions, 2813 flow [2021-12-07 00:27:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:27:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:27:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1442 transitions. [2021-12-07 00:27:29,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7879781420765027 [2021-12-07 00:27:29,631 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1442 transitions. [2021-12-07 00:27:29,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1442 transitions. [2021-12-07 00:27:29,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:29,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1442 transitions. [2021-12-07 00:27:29,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.2) internal successors, (1442), 10 states have internal predecessors, (1442), 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) [2021-12-07 00:27:29,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:29,633 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2021-12-07 00:27:29,633 INFO L186 Difference]: Start difference. First operand has 311 places, 260 transitions, 2290 flow. Second operand 10 states and 1442 transitions. [2021-12-07 00:27:29,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 281 transitions, 2813 flow [2021-12-07 00:27:29,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 281 transitions, 2655 flow, removed 12 selfloop flow, removed 11 redundant places. [2021-12-07 00:27:29,657 INFO L242 Difference]: Finished difference. Result has 302 places, 186 transitions, 1234 flow [2021-12-07 00:27:29,658 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1234, PETRI_PLACES=302, PETRI_TRANSITIONS=186} [2021-12-07 00:27:29,658 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 142 predicate places. [2021-12-07 00:27:29,658 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 186 transitions, 1234 flow [2021-12-07 00:27:29,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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) [2021-12-07 00:27:29,658 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:29,659 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:29,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-07 00:27:29,659 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -659104501, now seen corresponding path program 4 times [2021-12-07 00:27:29,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:29,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641744940] [2021-12-07 00:27:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:29,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:29,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641744940] [2021-12-07 00:27:29,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641744940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:29,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:29,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:29,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508765000] [2021-12-07 00:27:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:29,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:29,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:29,711 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:29,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 186 transitions, 1234 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:29,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:29,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:29,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:29,892 INFO L129 PetriNetUnfolder]: 167/852 cut-off events. [2021-12-07 00:27:29,893 INFO L130 PetriNetUnfolder]: For 3868/3922 co-relation queries the response was YES. [2021-12-07 00:27:29,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 852 events. 167/852 cut-off events. For 3868/3922 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4945 event pairs, 47 based on Foata normal form. 20/807 useless extension candidates. Maximal degree in co-relation 2490. Up to 86 conditions per place. [2021-12-07 00:27:29,899 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 49 selfloop transitions, 36 changer transitions 29/224 dead transitions. [2021-12-07 00:27:29,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 224 transitions, 1844 flow [2021-12-07 00:27:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:27:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:27:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1860 transitions. [2021-12-07 00:27:29,901 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7818411097099621 [2021-12-07 00:27:29,901 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1860 transitions. [2021-12-07 00:27:29,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1860 transitions. [2021-12-07 00:27:29,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:29,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1860 transitions. [2021-12-07 00:27:29,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.07692307692307) internal successors, (1860), 13 states have internal predecessors, (1860), 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) [2021-12-07 00:27:29,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 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) [2021-12-07 00:27:29,905 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 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) [2021-12-07 00:27:29,905 INFO L186 Difference]: Start difference. First operand has 302 places, 186 transitions, 1234 flow. Second operand 13 states and 1860 transitions. [2021-12-07 00:27:29,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 224 transitions, 1844 flow [2021-12-07 00:27:29,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 1310 flow, removed 17 selfloop flow, removed 63 redundant places. [2021-12-07 00:27:29,916 INFO L242 Difference]: Finished difference. Result has 225 places, 183 transitions, 949 flow [2021-12-07 00:27:29,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=949, PETRI_PLACES=225, PETRI_TRANSITIONS=183} [2021-12-07 00:27:29,916 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 65 predicate places. [2021-12-07 00:27:29,917 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 183 transitions, 949 flow [2021-12-07 00:27:29,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:29,917 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:29,917 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:29,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-07 00:27:29,917 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1706724921, now seen corresponding path program 5 times [2021-12-07 00:27:29,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565770077] [2021-12-07 00:27:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:29,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:29,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565770077] [2021-12-07 00:27:29,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565770077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:29,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:29,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:29,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201916262] [2021-12-07 00:27:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:29,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:29,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:29,946 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-07 00:27:29,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 183 transitions, 949 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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) [2021-12-07 00:27:29,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:29,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-07 00:27:29,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:30,028 INFO L129 PetriNetUnfolder]: 111/629 cut-off events. [2021-12-07 00:27:30,029 INFO L130 PetriNetUnfolder]: For 2663/2714 co-relation queries the response was YES. [2021-12-07 00:27:30,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 629 events. 111/629 cut-off events. For 2663/2714 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3032 event pairs, 35 based on Foata normal form. 28/601 useless extension candidates. Maximal degree in co-relation 1635. Up to 91 conditions per place. [2021-12-07 00:27:30,033 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 40 selfloop transitions, 11 changer transitions 2/185 dead transitions. [2021-12-07 00:27:30,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 185 transitions, 1098 flow [2021-12-07 00:27:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:27:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 627 transitions. [2021-12-07 00:27:30,035 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8565573770491803 [2021-12-07 00:27:30,035 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 627 transitions. [2021-12-07 00:27:30,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 627 transitions. [2021-12-07 00:27:30,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:30,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 627 transitions. [2021-12-07 00:27:30,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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) [2021-12-07 00:27:30,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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) [2021-12-07 00:27:30,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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) [2021-12-07 00:27:30,036 INFO L186 Difference]: Start difference. First operand has 225 places, 183 transitions, 949 flow. Second operand 4 states and 627 transitions. [2021-12-07 00:27:30,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 185 transitions, 1098 flow [2021-12-07 00:27:30,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 185 transitions, 1015 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-12-07 00:27:30,044 INFO L242 Difference]: Finished difference. Result has 216 places, 180 transitions, 913 flow [2021-12-07 00:27:30,044 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=913, PETRI_PLACES=216, PETRI_TRANSITIONS=180} [2021-12-07 00:27:30,044 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 56 predicate places. [2021-12-07 00:27:30,044 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 180 transitions, 913 flow [2021-12-07 00:27:30,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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) [2021-12-07 00:27:30,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:27:30,045 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:30,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-07 00:27:30,045 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-07 00:27:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1293108867, now seen corresponding path program 1 times [2021-12-07 00:27:30,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:30,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589758420] [2021-12-07 00:27:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:30,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:30,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:30,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589758420] [2021-12-07 00:27:30,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589758420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:30,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:30,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:27:30,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013335125] [2021-12-07 00:27:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:30,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:30,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:30,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-07 00:27:30,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 180 transitions, 913 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:30,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:27:30,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-07 00:27:30,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:27:30,215 INFO L129 PetriNetUnfolder]: 121/643 cut-off events. [2021-12-07 00:27:30,215 INFO L130 PetriNetUnfolder]: For 3244/3318 co-relation queries the response was YES. [2021-12-07 00:27:30,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1769 conditions, 643 events. 121/643 cut-off events. For 3244/3318 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3141 event pairs, 27 based on Foata normal form. 27/610 useless extension candidates. Maximal degree in co-relation 1733. Up to 86 conditions per place. [2021-12-07 00:27:30,218 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 194/194 dead transitions. [2021-12-07 00:27:30,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 194 transitions, 1222 flow [2021-12-07 00:27:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:27:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:27:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1285 transitions. [2021-12-07 00:27:30,219 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7802064359441409 [2021-12-07 00:27:30,219 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1285 transitions. [2021-12-07 00:27:30,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1285 transitions. [2021-12-07 00:27:30,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:30,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1285 transitions. [2021-12-07 00:27:30,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.77777777777777) internal successors, (1285), 9 states have internal predecessors, (1285), 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) [2021-12-07 00:27:30,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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) [2021-12-07 00:27:30,222 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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) [2021-12-07 00:27:30,222 INFO L186 Difference]: Start difference. First operand has 216 places, 180 transitions, 913 flow. Second operand 9 states and 1285 transitions. [2021-12-07 00:27:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 194 transitions, 1222 flow [2021-12-07 00:27:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 194 transitions, 1169 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-12-07 00:27:30,229 INFO L242 Difference]: Finished difference. Result has 221 places, 0 transitions, 0 flow [2021-12-07 00:27:30,229 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=221, PETRI_TRANSITIONS=0} [2021-12-07 00:27:30,230 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 61 predicate places. [2021-12-07 00:27:30,230 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 0 transitions, 0 flow [2021-12-07 00:27:30,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 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) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-12-07 00:27:30,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-07 00:27:30,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-07 00:27:30,235 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:30,238 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-07 00:27:30,238 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:27:30,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:27:30 BasicIcfg [2021-12-07 00:27:30,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:27:30,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:27:30,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:27:30,241 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:27:30,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:58" (3/4) ... [2021-12-07 00:27:30,243 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-07 00:27:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2021-12-07 00:27:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2021-12-07 00:27:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2021-12-07 00:27:30,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-07 00:27:30,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-07 00:27:30,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-07 00:27:30,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 00:27:30,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:27:30,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:27:30,273 INFO L158 Benchmark]: Toolchain (without parser) took 33118.52ms. Allocated memory was 100.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 65.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-07 00:27:30,273 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 71.3MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:27:30,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.21ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 66.6MB in the end (delta: -983.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:27:30,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.76ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 63.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 00:27:30,275 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 61.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:27:30,275 INFO L158 Benchmark]: RCFGBuilder took 479.91ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 70.2MB in the end (delta: -8.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2021-12-07 00:27:30,275 INFO L158 Benchmark]: TraceAbstraction took 32130.79ms. Allocated memory was 100.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 69.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-07 00:27:30,276 INFO L158 Benchmark]: Witness Printer took 31.84ms. Allocated memory is still 2.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:27:30,278 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.14ms. Allocated memory is still 71.3MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.21ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 66.6MB in the end (delta: -983.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.76ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 63.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 61.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.91ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 70.2MB in the end (delta: -8.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32130.79ms. Allocated memory was 100.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 69.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 31.84ms. Allocated memory is still 2.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 269 locations, 7 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: 32.0s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3062 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3062 mSDsluCounter, 1980 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3491 mSDsCounter, 704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8858 IncrementalHoareTripleChecker+Invalid, 9562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 704 mSolverCounterUnsat, 619 mSDtfsCounter, 8858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3296occurred in iteration=21, InterpolantAutomatonStates: 363, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2785 NumberOfCodeBlocks, 2785 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 13972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-12-07 00:27:30,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf712c6b-993c-4905-b102-45c94516e864/bin/uautomizer-DrprNOufMa/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 Result: TRUE